Flashcard: Mastering Sorting Algorithms — 10 carte

Comparison-based Sorting — definition?

Sorts by comparing element pairs.

Comparison-based Sorting — definition?

Sorts by comparing pairs of elements.

Non-comparison Sorting — role?

Uses keys or digits, not comparisons, for sorting.

Stable Sort — role?

Preserves relative order of equal elements.

Bubble Sort — mechanism?

Repeatedly swaps adjacent out-of-order elements.

In-Place Sorting — meaning?

Modifies the original data without extra memory.

Divide and Conquer — purpose?

Recursively breaks down problems for easier solution.

Pivot Element — in Quick Sort?

Element around which array is partitioned.

Comparison sort lower bound?

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

Non-comparison Sorting — example?

Counting Sort.