Question: Which sorting algorithm work on this principle: Sort an array by repeatedly finding the smallest element ( if sorting in ascending order ) from unsorted
Which sorting algorithm work on this principle:
"Sort an array by repeatedly finding the smallest element if sorting in ascending order from unsorted part of list and move to the sorted list"
Question options:
Bubble Sort
Selection Sort
Merge Sort
Binary Sort
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
