@desc: splits the array into two sections at each step, then checks the element in the desired one. * @param: array , key (to be found), size of the array. * @return: index of key if present , -1 otherwise. * @TimeComplexity: O( logn ) < n = size of the array > */
source not stored for this graph (policy: none)