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 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
|
#include "stdafx.h" #include <iostream> #include <cstdlib> #include <ctime> using namespace std;
#define MAX_SIZE 20 void MakeHeap(int value[]) { for (int i = 0; i < MAX_SIZE; i++) { int index = i; while (index != 0) { int parent = (index - 1) / 2; if (value[index] <= value[parent]) { break; } int temp = value[index]; value[index] = value[parent]; value[parent] = temp;
index = parent; } } }
int RemoveTopItem(int value[], int count) { int result = value[0];
value[0] = value[MAX_SIZE - 1]; int index = 0; while (1) { int child1 = 2 * index + 1; int child2 = 2 * index + 2; if (child1 >= count) child1 = index; if (child2 >= count) child2 = index;
if (value[index] >= value[child1] && value[index] >= value[child2]) { break; }
int swap_child; if (value[child1] > value[child2]) swap_child = child1; else swap_child = child2;
int temp = value[index]; value[index] = value[swap_child]; value[swap_child] = temp;
index = swap_child; } return result; } void HeapSort(int value[]) { MakeHeap(value);
for (int i = MAX_SIZE - 1; i >= 0; i--) { int temp = value[0]; value[0] = value[i]; value[i] = temp;
RemoveTopItem(value, i); //MakeHeap(value); } } void InitArray(int value[], int size) { for (int i = 0; i < size; i++) { value[i] = rand() % MAX_SIZE + 1; } } void TraverseArray(int value[], int size) { for (int i =0;i < size;i++) { cout << value[i] << " "; } cout << "n"; } int main() { srand(time(0)); int value[MAX_SIZE]; InitArray(value, MAX_SIZE);//初始化数组 //TraverseArray(value, MAX_SIZE); //遍历数组 MakeHeap(value); //转换数组为堆 TraverseArray(value, MAX_SIZE); RemoveTopItem(value, MAX_SIZE); //HeapSort(value); TraverseArray(value, MAX_SIZE); return 0; }
|
近期评论