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. }
  6. if (A'[i-1] != temp) {
  7. A'[i]:= temp
  8. }
  9. }
  10. b_deleteDuplicates(A[0...n-1]) :A'[0...n-1] {
  11. for (i=0 to n-1) do {
  12. A'[i] := null
  13. }
  14. for (i=0 to n-1) do {
  15. h:= H(A[i]) //H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet
  16. A'[h]:= A[i]
  17. }
  18. }
  19. return A'

goto line:
Compare with:
text copy window edit this code post new code