Example 63: Binary Search

Problem

The binary search method is a fast and efficient searching algorithm. This method requires that the list of elements be in sorted order. It is based on the Divide and Conquer Algorithm as it divides the array into two parts.

Write a function that performs a binary search on an array of 10 integers.

Demonstration