Multiple Choice
A(n) ____ finds which element belongs in a particular position on each pass through the array and moves it there.
A) selection sort
B) bubble sort
C) insertion sort
D) merge sort
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q5: The programming logic for a bubble sort
Q6: You can make an ascending bubble sort
Q7: When sorting a selection sort in ascending
Q8: The selection sort uses a nested While
Q9: A bubble sort is more efficient than
Q11: A(n) _ builds a sorted array by
Q12: All sorting algorithms use an outer For
Q13: To reverse the order of array elements,
Q14: A(n) _ is the most straightforward sorting
Q15: The sort() method arranges array elements in