// selection sort on n elementsWhat is the time complexity?
- A
O(log n)
- B
O(n)
- C
O(n log n)
- Dcheck_circle
O(n^2)
Explanation
Selection sort always makes ~n^2/2 comparisons regardless of input.
Sorting
AP Computer Science A· difficulty 2/5
Want 10 more like this — adaptive to your weak spots?