Write an algorithm/pseudocode to sort elements using Heap sort technique?

Program to implement heap sort

Apply bubble sort, insertion sort, counting sort, heap sort, quick sort, and merge sort on the followingarray: 15,25,20,22,30,10,1,9,15,50 and write pseudocode of each and analyze their time complexity

What is the space complexity of Heap Sort?

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if they are not in order relative to each other. A. quick sort B. bubble sort C. insertion sort D. merge sort E. selection sort

Compare merge sort, quick sort, and heap sort