1. a_deleteDuplicates(A[0...n-1]) :A'[0...n-1]
  2. buildHeap(A) //as it's done in heapsort
  3. for (i=n downto 2) do
  4. temp := Heap.deleteMin
  5. if (A'[i-1] != temp)
  6. A'[i]:= temp
  7. b_deleteDuplicates(A[0...n-1]) :A'[0...n-1]
  8. for (i=0 to n-1) do
  9. A'[i] := null
  10. for (i=0 to n-1) do
  11. h:= H(A[i]) //H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet
  12. A'[h]:= A[i]
  13. return A'

Diesen Code in Standard-Formatierung anzeigen
goto line:
Compare with:
text copy window edit this code post new code