Implementing Binary Search of an Array

We'll cover the following

Let's think about binary search on a sorted array. Many programming languages already provide methods for determining whether a given element is in an array and, if it is, its location. But we want to implement it ourselves, to understand how you can implement such methods. Here's an array of the first 25 prime numbers, in order:

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy