Which of the following sorting algorithms is not suitable for large arrays?
2025
Which of the following sorting algorithms is not suitable for large arrays?
Answer: C. Bubble sort — Bubble sort has worst-case and average complexity of O(n²), where n is the number of items being sorted, making it inefficient on large lists.
- A.
Quick sort
- B.
Merge sort
- C.
Bubble sort
- D.
Heap sort
Attempted by 335 students.
Show answer & explanation
Correct answer: C
Bubble sort has worst-case and average complexity of O(n²), where n is the number of items being sorted, making it inefficient on large lists.
Loading lesson…