private static void Adjust (int[] list, int i, int m)
{
    int Temp = list[i];
    int j = i * 2 + 1;
  
    while (j <= m)
    {
        //more children
        if(j < m)
            if(list[j] < list[j + 1])
                j = j + 1;
  
        //compare roots and the older children
        if(Temp < list[j])
        {
            list[i] = list[j];
            i = j;
            j = 2 * i + 1;
        }
        else
        {
            j = m + 1;
        }
    }
  
    list [i] = Temp;
}
public static void HeapSort (int[] list)
{
    //build the initial heap
    for (int i = (list.Length - 1) / 2; i > = 0; i-)
        Adjust (list, i, list.Length - 1);
  
    //swap root node and the last heap node
    for (int i = list.Length - 1; i > = 1; i-)
    {
        int Temp = list [0];
        list [0] = list [i];
        list [i] = Temp;
        Adjust (list, 0, i - 1);
    }
}

標簽： swap

版權申明：本站文章部分自網(wǎng)絡，如有侵權，請聯(lián)系：west999com@outlook.com
特別注意：本站所有轉載文章言論不代表本站觀點！
本站所提供的圖片等素材，版權歸原作者所有，如需使用，請與原作者聯(lián)系。