Questions
32 of 59
Write down the time complexities of Bubble, Selection, Insertion Sort.
Difficulty: 1/10
Basic Sorting Complexities
Bubble Sort, Selection Sort, and Insertion Sort are elementary comparison-based algorithms. Their typical and worst-case complexities are O(n²). Insertion Sort can achieve O(n) best-case performance when the input is already sorted, while optimized Bubble Sort can also achieve O(n) best case.
javascript
- 1
Bubble Sort repeatedly swaps adjacent out-of-order elements.
- 2
Selection Sort repeatedly selects the minimum.
- 3
Insertion Sort inserts each element into the sorted prefix.
- 4
Insertion Sort is often practical for small or nearly sorted data.
Follow-up Questions
- Which of these is stable?
- Why is insertion sort good for nearly sorted data?