Sorting · Class 12 · CBSE · Science Computer Science
For an already sorted list of n elements, explain why insertion sort can be more efficient than selection sort, and state the best-case time complexi…
Practice question from Sorting (Class 12 · CBSE · Science Computer Science), with the correct answer and a step-by-step solution.
hard · Subjective · Q-445B2A
For an already sorted list of n elements, explain why insertion sort can be more efficient than selection sort, and state the best-case time complexity of each algorithm.
Solution
Insertion sort detects that each element is already in the correct relative position, so it makes only a linear number of comparisons. Selection sort performs nearly the same minimum-selection work regardless of the initial order, resulting in quadratic time.
More from Sorting
- Which statement correctly describes the difference between list.sort() and sorted() in Python?
- A single left-to-right pass of bubble sort is performed in ascending order on the list [7, 2, 5, 3, 1]. What will the list be after this pa…
- In an ascending selection sort, what will the list [64, 25, 12, 22, 11] become after the first pass?
- Which combination correctly describes the standard in-place selection sort for a list of n elements?
Practise more Computer Science
Sign up free for adaptive practice on this chapter, with instant feedback and hints on every question.
Start practising freeFree to start · No credit card needed