A "stable" sort
- Acheck_circle
Preserves the relative order of equal elements
- B
Cannot fail
- C
Sorts in place only
- D
Always sorts in O(log n)
Explanation
Relevant for sorting by multiple keys (e.g., sort by name then by age).
AP Computer Science A· difficulty 4/5
A "stable" sort
Preserves the relative order of equal elements
Cannot fail
Sorts in place only
Always sorts in O(log n)
Explanation
Relevant for sorting by multiple keys (e.g., sort by name then by age).
Want 10 more like this — adaptive to your weak spots?