Overview
In this lesson, you’ll learn how the binary search algorithm works to find information efficiently and elegantly.
Prerequisites
- Big O Notation
- Recursion
- Intro to Sorting Algorithms
Learning Objectives
By the end of this module, learners will be able to:
- Understand the Big O complexities of brute force and binary search approaches.
- Describe how binary search works.
- Write a binary search algorithm to find a value in an array.
Content
There are two components to this module:
- Lesson: Search Algorithms
- Exercise: Implementing Binary Search
Solution Code
- Exercise Solution: Binary Search
Time to Complete
1.5 hours total:
- 0.5 hour - Search Algorithms Lesson
- 1 hour - Implementing Binary Search Exercise
Additional Resources
- Check out this article that outlines common interview questions related to binary search: An article on binary search practice problems.
- Algorithmic folk dancers, this time with search: A fun video demonstrating binary search through dance.
Internal resources
Find a 👾 bug 👾 or have suggestions? Let us know!