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
8. b_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ]
9. for( i = 0 to n - 1 ) do
10. A'[ i ] : = null
11. for( i = 0 to n - 1 ) do
12. h: = H( A[ i ] ) // H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet
13. A'[ h ] : = A[ i ]
14. 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