Binary Search Visualization

Problem Statement:

Binary Search:
Given a sorted array and a target, repeatedly halve the search interval until found.

Example: nums = [1,3,4,6,8,10,14], target = 8

Step 0: Initialize low=0, high=n-1