Minimum heap of data structures and algorithms

AlgorithmIdea: the nodes in the binary heap are linearly indicated by arrays. The index relationship between the parent node and Its left child is: leftchild = 2 * parient + 1;
When a node with a large value moves down, you must determine the relationship between the value of the node and the size of the left and right child nodes.CodeYou need to nest a loop to ensure the subsequent size relationship.

# Include <iostream> using namespace STD; // minimum heap sorting int heap [] = {53,17, 78,9, 45,65, 87,23}; void show () {for (INT I = 0; I <8; I ++) {cout