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

a_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ] { buildHeap( A ) // as it's done in heapsort for( i = n downto 2 ) do { temp : = Heap.deleteMin } if( A'[ i - 1 ] != temp ) { A'[ i ] : = temp } } b_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ] { for( i = 0 to n - 1 ) do { A'[ i ] : = null } for( i = 0 to n - 1 ) do { h: = H( A[ i ] ) // H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet A'[ h ] : = A[ i ] } } return A'

Impressum
Quelltext