Selection sort, bubble sort, and insertion sort all have worst-case time
- A
O(n log n)
- B
O(n)
- Ccheck_circle
O(n²)
- D
O(2ⁿ)
Explanation
Quadratic; not suitable for large n.
Developing Algorithms Using Arrays
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?