Sorting and Searching

Module Contents

  1. Introduction to Sorting

Master the fundamental algorithms for organizing and finding data. Stable vs Unstable sorts, and the power of Binary Search.

  1. Basic Sorts

Master the fundamentals of Bubble, Selection, and Insertion Sort. Understand why O(N2) algorithms are sometimes faster than O(N log N) for small inputs.

  1. Merge Sort & Quick Sort

The titans of sorting. Divide and Conquer mastery. Understand Stability, Recursion Depth, and the Pivot problem.

  1. Non-Comparison Sorts

Break the O(N log N) barrier. Learn Counting Sort, Radix Sort, and Bucket Sort. Understand when to trade Space for Time.

  1. Binary Search Applications

  2. Real System Sorting

  3. Review & Cheat Sheet

Practice

[!NOTE] Looking for hands-on algorithmic exercises? We have migrated all coding challenges for this module into the Problem Vault to give you a centralized, focused practice environment.

Module Chapters