Week 3 Algorithms
Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: \(O\), \(\Omega\), \(\Theta\). Recursion.
- Lecture
- Shorts
- Section
- Problem Set 3
This is CS50x 2025, an older version of the course. See cs50.harvard.edu/x/2026 for the latest!
Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: \(O\), \(\Omega\), \(\Theta\). Recursion.