Question: In this algorithm, the smallest value in the array is located and moved to element 0. Then the next smallest value is located and moved
In this algorithm, the smallest value in the array is located and moved to element 0. Then the next smallest value is located and moved to element 1. This process continues until all of the elements have been placed in their proper order.
a. Bubble sort
b. Selection sort
c. Insertion sort
d. Sequential sort
Step by Step Solution
3.42 Rating (155 Votes )
There are 3 Steps involved in it
The correct answer is b Selection sort Explanation Selection sort works by iteratively findi... View full answer
Get step-by-step solutions from verified subject matter experts
