Sorting

AP Computer Science A· difficulty 4/5

A "stable" sort

  • A

    Preserves the relative order of equal elements

    check_circle
  • 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).

Want 10 more like this — adaptive to your weak spots?

Related questions