Shulou(Shulou.com)06/02 Report--

This article shows you how to implement the basic operation of the C language data structure heap, which is concise and easy to understand, which can definitely brighten your eyes. I hope you can get something through the detailed introduction of this article.

1. The realization of the basic function a. Code 1 (downward adjustment) void AdjustDown (DateType*a, int n, int parent) {int child = parent * 2 + 1; while (child a [child + 1]) {+ + child } if (a [parent] > a [child]) {Swap (& a [parent], & a [child]); parent = child; child = parent * 2 + 1 } else {break;}

Note: conditional statement (child + 1) 0 in if {if (a [child])

< a[parent]) { Swap(&a[child], &a[parent]); child = parent; parent = (child - 1) / 2; } else { break; } }} 注意:while里面的条件语句是不能够写成(parenta == NULL) { printf("malloc failed\n"); exit(-1); } memcpy(p->

A, num, n * sizeof (DateType); p-> size = n; p-> capacity = n; / / Jian Xiaopu for (int I = (n-1-1) / 2; I > = 0; iMuk -) {AdjustDown (p-> a, p-> size, I);}} 3. Insert data void HeapPush (Heap*p, DateType x) {assert (p); if (p-> size = = p-> capacity) {DateType*tmp = (DateType*) realloc (p-> a, (p-> capacity) * 2 * sizeof (DateType)); if (tmp = NULL) {printf ("realloc failed\ n") Exit (- 1);} (p-> capacity) * = 2; p-> a [p-> size] = x; + (p-> size); / / upward adjust AdjustUp (p-> a, p-> size-1);} 4. Delete data void HeapPop (Heap*p, DateType x) {assert (p); Swap (& p-> a [0], & p-> a [p-> size-1]);-- (p-> size); AdjustDown (p-> a, p-> size, 0); / / left and right subtrees are still small heaps, directly adjust the rows}

Exchange the data at the top of the heap with the last data, and adjust the size-1 data again.

5. Get the data DateType HeapTop (Heap*p) {assert (p); return p-> a [0];} 6. The number of heap data int HeapSize (Heap*p) {assert (p); return p-> size;} 7. Null bool HeapIsEmpty (Heap*p) {assert (p); return p-> size = = 0;} 8. Print void Print (Heap*p) {assert (p); for (int I = 0; I

< p->

Size; iTunes +) {printf ("% d", (p-> a) [I]);} printf ("\ n"); int count = 0 int levelsize / count int levelsize = 1; for (int I = 0; I

< p->

Size; iTunes +) {printf ("% d", p-> a [I]); + + count; if (count = = levelsize) {printf ("\ n"); levelsize * = 2; count = 0 / / re-count}} printf ("\ n");} 9. Destroy void HeapDestory (Heap*p) {assert (p); free (p-> a); p-> a = NULL; p-> capacity = p-> size = 0;} 10. Test int main () {int num [] = {12 sizeof (num) / sizeof (num [0]); Heap a; / create a small heap of CreatHeap (& a); Print (& a); printf ("\ n"); / / insert data HeapPush (& a, 1); Print (& a) / / Delete top data HeapPop (& a); Print (& a); printf ("\ n"); / / get heap top data int ret=HeapTop (& a); printf ("The top date is% d\ n", ret); / / number of heap data int number=HeapSize (& a); printf ("The number of heap is% d\ n", number) / / destroy HeapDestory (& a); return 0;} 11. Test result

twelve。 Sort with heap (descending)

a. Code 1

Int main () {DateType num [] = {12 int 15, 17 17, 23 10 25}; int n = sizeof (num) / sizeof (num [0]); HeapSort (num, n); for (int I = 0; I

< n; i++) { printf("%d ", num[i]); } printf("\n\n"); return 0;}void HeapSort(int*num, int n){ //建小堆 for (int i = (n - 1 - 1) / 2; i >

= 0; iMel -) {AdjustDown (num, n, I);} int end = n-1; while (end > 0) {Swap (& num [0], & Num [end]); AdjustDown (num, end, 0);-- end;}}

Running result

The above is what the basic operation of the C language data structure heap is. Have you learned the knowledge or skills? If you want to learn more skills or enrich your knowledge reserve, you are welcome to follow the industry information channel.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.