Binary Search on Sorted Array

Given a sorted array of size N and an integer K, find the position at which K is present in the array using binary search. SOLUTION: Binary search divides the input array by half at every step. After every step, either we find the index we are lookin...