Advertisements
Advertisements
प्रश्न
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?
विकल्प
Insertion sort
Quick sort
Heap sort
Selection sort
MCQ
Advertisements
उत्तर
Heap sort
shaalaa.com
Selection Sort in Python
क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
