Chapter 6 "minimum priority queue" for heap sorting (Exercise 6.5-3)

Use the smallest heap to implement the smallest priority queue:

// Returns the element with the smallest keyword in the heap.

Heapminimum ()

// Remove and return the element with the smallest keyword in the heap

Heapextractmin ()

// Reduce the keyword of element x in the heap to K, and K to be smaller than the original keyword value of X.

Heapdecreasekey ()

// Insert element x into the heap

Minheapinsert ()

# Include <stdio. h> # include <string. h> # include <time. h> # define buffer_size 10 // heap adjustment to keep the heap nature void minheapify (int * a, int I, int heapsize) {int left = 0; int right = 0; int smallest = I; int TMP = 0; while (I