/*Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). You are given a target value to search. If found ...

//It is a rotated sorted array meaning half of it is sorted. In this case the binary search will have 4 conditions meaning at first it will find //If the sorted part is in right side or left sde by ...