Linear vs Binary Search: Worst-Case Comparisons and a Traced Search
This lesson is part of the course
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Counting Steps: Single, Nested and Halving Loops Pro
- Growth Tables: n log n, n², 2ⁿ and Where the Curves Cross Pro
- Linear vs Binary Search: Worst-Case Comparisons and a Traced Search Pro
- Sorting Comparisons: n(n−1)/2 vs n · log₂ n and One Traced Pass Pro
- Time Budgets: Steps per Second, Run Times and the Largest n in One Second Pro
- Hash Tables: Load Factor, Expected Probes and Resize Thresholds Pro
- Caching: Hit Rates, Average Access Time and Cache Size Pro
- Dynamic Arrays & Amortised Cost, Capstone: Choose the Algorithm Pro