Flashcards : Mastering Sorting Algorithms — 10 cartes

Sorts by comparing element pairs.

Sorts by comparing pairs of elements.

Uses keys or digits, not comparisons, for sorting.

Preserves relative order of equal elements.

Repeatedly swaps adjacent out-of-order elements.

Modifies the original data without extra memory.

Recursively breaks down problems for easier solution.

Element around which array is partitioned.

O(n log n) in average and worst cases.

Counting Sort.