ISRO | ISRO CS 2007 | Question 55
Selection sort algorithm design technique is an example of
(A) Greedy method
(C) Dynamic Programming
Explanation: The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.
1) The subarray which is already sorted.
2) Remaining subarray which is unsorted.
In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray. Clearly, it is a greedy approach to sort the array.
Option (A) is correct.
Quiz of this Question