Multiple Choice
A(n) ____ is the most straightforward sorting algorithm but often the least efficient.
A) selection sort
B) bubble sort
C) insertion sort
D) merge sort
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q9: A bubble sort is more efficient than
Q10: A(n) _ finds which element belongs in
Q11: A(n) _ builds a sorted array by
Q12: All sorting algorithms use an outer For
Q13: To reverse the order of array elements,
Q15: The sort() method arranges array elements in
Q16: A(n) _ involves comparing adjacent elements and
Q17: Sorting is often done on arrays because
Q18: Putting data items in order is called
Q19: Which of the following swaps the values