Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading lessons

Sorting: Data Structures and Algorithms: Uncharted

Courses Data Structures and AlgorithmsSorting

SortingPro

Compare elementary sorts, divide-and-conquer sorts, stability, and data-aware alternatives.

Data Structures and Algorithms
Unit 7 of 16
20 lessons
128 min
420 XP

This unit is part of Pro. Upgrade to open every lesson in it.

Lessons

20 total

1The Sorting InstinctIdentify the sorted region and movement rule that distinguish insertion, selection, and bubble sort.ProInteractiveConcept6 min20 XPOpen
2Selection ScanApply selection-sort minimum scan to scanning the unsorted suffix for its smallest value.ProCodeConcept6 min20 XPOpen
3Insertion into PlaceApply insertion-sort shift into a sorted prefix to shifting a nearly sorted prefix only as far as needed.ProCodeConcept6 min20 XPOpen
4Bubble, and RetireApply bubble-sort adjacent pass to bubbling the largest remaining value to the retired suffix.ProCodeConcept6 min20 XPOpen
5Predict the PassPredict exactly what one bubble-sort pass guarantees without completing later passes.ProInteractiveConcept6 min20 XPOpen
6The n-Squared WallApply measured every-pair comparison wall to counting every unordered pair as input size grows.ProCodeConcept6 min20 XPOpen
7Split, Sort, MergeApply recursive split-sort-merge to recursively sorting halves before zipper-merging them.ProCodeConcept6 min20 XPOpen
8Count the Merge StepsApply merge-sort n-log-n comparison counter to reporting merge comparisons beside the sorted result.ProCodeConcept6 min20 XPOpen
9Pick a PivotApply end-pivot partition to partitioning values around the final fixed pivot.ProCodeConcept6 min20 XPOpen
10Quicksort, CompleteApply deterministic end-pivot quicksort to recursing on both sides of a deterministic partition.ProCodeConcept6 min20 XPOpen
11The Unlucky PivotExplain why choosing an extreme end pivot on sorted data produces one-sided quadratic quicksort.ProInteractiveConcept6 min20 XPOpen
12Stable or NotDetermine whether equal-key records preserve their prior relative order after sorting.ProInteractiveConcept6 min20 XPOpen
13The Built-In TruthApply JavaScript default-order trap, numeric comparator, and Python key sorting to contrasting Python sorted with a key and JavaScript sort with a numeric comparator, including JavaScript’s default string-order trap.ProCodeConcept6 min20 XPOpen
14Sort by KeyApply score-descending name-ascending key sort to ordering a leaderboard by descending score then ascending name.ProCodePractice8 min20 XPOpen
15Counting SortApply frequency-bucket counting sort to emptying small-range integer frequency buckets in order.ProCodeConcept6 min20 XPOpen
16Bucket ThinkingDecide whether a bounded key range makes bucket-based sorting practical in time and space.ProInteractiveConcept6 min20 XPOpen
17Merge Three PlaylistsApply repeated pairwise sorted merge to repeatedly merging three already sorted playlists.ProCodePractice8 min20 XPOpen
18The Sortedness CheckApply sortedness scan then insertion repair to validating order before repairing a nearly sorted array.ProCodeConcept6 min20 XPOpen
19Choose Your SortSelect a sorting strategy from input size, existing order, key range, stability, and memory constraints.ProInteractiveConcept6 min20 XPOpen
20Sorting Mastery CheckApply stable divide-and-merge sorting review to rebuilding a stable divide-sort-merge pipeline.ProCodeMastery check10 min40 XPOpen

Recursion and Divide and Conquer Binary Search