Question

Data Structures using C

BuildHeap and Heap Sort In preparation: If you have not done so already, you should complete Worksheet 33 to leam more about the heap data structure. In some applications it is useful to void buildHeap (struct dyArray heap) { initialize a Heap with an existing vector int max = dy Array Size(heap); int i; of values. The values are not assumed for (i = max/2-1; i >= 0; i--) to be organized into a heap, and so a _adjustHeap(heap, max, i); routine named buildHeap is invoked for } this purpose To understand the buildHeap algorithm, consider the following diagram: 12 First iteration: adjust largest non-leaf node (index 4) adjystHeap i (max/2-1) 11 10 max 10 11 0 1 2 3 4 5 6 7 8 9 127 5837 9 11 10 Already heaps (leaf nodes) All values indexed after max/2 are leaves, and are therefore already a heap. The first value that could potentially not be a heap is found at max/2. Walking backwards from this value until the root is reached eventually makes all nodes into a heap. The heap data structure provides an void heapsort (struct dyArray *v) { int i; elegant technique for sorting a vector. buildHeap(v); First for the vector into a heap. To sort for (i = dyArray Size(v) – 1;i> 0; i--) { the vector, the top of the heap (the dyArraySwap(v, 0, 1); smallest element) is swapped with the _adjustHeap (v, i, 0); last element, and the size of the heap is reduced by 1 and readjusted. Repeat until all elements have been processed. } }

Answer 1

Find the solution to the above question below, do read all the steps provided carefully and in case of any comments do comment below. If found helpful please upvote this.

$1596282224591_IMG_20200801_171024428.png$

Applying heap sort first and remove O replace with s neepify. 3 2 8 6 heapify. 3 4 & Z 9 6 2) replace it with 6 4 heapify 4 3

$1596282238539_IMG_20200801_171036129.png$

$1596282251216_IMG_20200801_171048302.png$