#include <stdio.h>
#include <string.h>

void HeapAdjust( int arry[], int left, int right )
{
    int index = left;

    for ( int i = left*2; i <= right; i = i*2 )//找到较大者
    {
        if( i < right && arry[i] < arry[i+1] )
        {
            i ++;
        }

        if( arry[index] > arry[i] )
        return ;

        swap( arry[index], arry{i} );
    }
}

void HeapSort( int arry[], int left, int right )
{
    int len = right - left + 1;

    for( int i = len/2; i >= left; i-- )//把数组调成大顶堆
        HeapAdjust( arry, i, right );
    
    for ( int i = right; i > left; i -- )//排序
    {
        swap( arry[left], arry[i] );
        HeapAdjust( arry, left, i - 1 );
    }
}