Question

In a sorting algorithm, the smallest element is selected from the unsorted array and swapped with the leftmost element and not considered for further passes. The process continues for the next element in the unsorted array till the list is sorted. Which algorithm are we referring to?

Options

• Insertion sort

• Quick sort

• Heap sort

• Selection sort

Answer 1

Heap sort