堆排序练习

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <iostream>
 
using namespace std;
 
int arr[] = {1,2,3,4,5,6 };
 
void swap(int& i, int& j)
{
    int k = i;
    i = j;
    j = k;
}
 
void HeapAdjust(int array[], int i,const int length)
{
    int lChild = i * 2;
    int rChild = i * 2 + 1;
    int max = i;
    if (i <= length / 2)
    {
        if (array[lChild - 1] > array[rChild - 1])
            max = lChild;
        else
            max = rChild;
        if (array[max-1] > array[i - 1])
        {
            swap(array[max-1], array[i - 1]);
            HeapAdjust(array,max,length);
        }
    }
}
 
 
int main()
{
    int arrLen = sizeof(arr) / sizeof(arr[0]);
    for (int i = arrLen / 2; i > 0; i--)
    {
        HeapAdjust(arr, i, arrLen);
    }
 
    for (int i = arrLen; i > 2; i--)
    {
        swap(arr[0], arr[i-1]);                                    
        HeapAdjust(arr, 1, i-2);           
    }
 
    return 0;
}

  

posted on   itdef  阅读(261)  评论(0编辑  收藏  举报

导航

< 2025年3月 >
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5

统计

点击右上角即可分享
微信分享提示