Sorting Algorithms Essentials

Test knowledge of sorting techniques.

1. What is the average-case time complexity of Quick Sort?
2. Which sorting algorithm uses a 'divide and conquer' approach?
3. Which algorithm repeatedly swaps adjacent elements if they are in the wrong order?
4. What is the best-case time complexity of Insertion Sort?
5. Which of the following is NOT a comparison-based sorting algorithm?
6. What is the space complexity of Merge Sort?
7. Which algorithm uses recursive partitioning around a pivot element?
8. What is the worst-case time complexity of Heap Sort?
9. Which of the following are stable sorting algorithms?
10. Which algorithms have an average-case time complexity of O(n log n)?
11. Which are considered in-place sorting algorithms (O(1) or O(log n) auxiliary space)?
12. Which algorithms perform well on nearly sorted arrays?
13. Which are non-comparison-based sorting algorithms?
14. Bubble Sort is more efficient than Merge Sort for large datasets.
15. Standard Quick Sort implementations are stable.
16. Insertion Sort is suitable for small datasets.
17. Heap Sort maintains stability for equal elements.
18. Name the sorting algorithm that builds a sorted array by inserting each element into its correct position one at a time.
19. What sorting algorithm uses a binary heap to repeatedly extract the maximum element and build the sorted array?
20. What term describes a sorting algorithm that preserves the relative order of equal elements?
Answered 0 of 0 — 0 correct