Selection sort algorithm design technique is an example of
My confusion is between option A ,C
Correct Answer would be A) Greedy Algorithm
Because, In the first iteration we put a pointer in the start of the array. Then next we start searching index of minimum element index in the rest of the array. Then replace the starting pointer value with minimum index value. (Considering the we are sorting in ascending order). Then repeat this process for each element.
Selection Sort is Brute force Approach
As we move through all the elements of array so greedy is within available elements we select min between 2 elements but we further move to all elements so i think it wont be greedy