Doubt for heap Sort Implimentation

#1

This is the code which was written but for
5 elements it did not work

#2

at line no 33

image
image785×241 12.8 KB

instead of curr_idx it must be min_idx

also your build function is wrong
correct one
image

Modified Code

#3

Could you please explain as to why at line number 33 have we used min_idx ?

#4

Suppose root->data is 3
Left 1 and right data is 2
Then in that case your code consider 2 as min
But actually 1 is min
Because you are checking with root not with min so far

This is simple calculation of min among 3