数据结构优先队列.pptVIP

heap sort java program public static void heapsort( Comparable [ ] a ) { for( int i = a.length / 2; i = 1; i-- ) percDown( a, i, a.length ); for( int i = a.length ; i 1; i-- ) { swapReferences( a, 1, i ); percDown( a, 1, i-1); } } heap sort private static void percDown( Comparable [ ] a, int i, int n ) { int child; Comparable tmp; for( tmp = a[ i ]; leftChild( i ) n; i = child ) { child = leftChild( i ); if( child != n – 1 a[child ].compareTo( a[ child + 1 ]) 0 ) child++; if( pareTo