MSA's blog

Fake it until you make it

:pushpin: CODE-LIBRARY: // author: MSA int BinarySearch(int a[],int n,int target) { int low=0, high =n-1; while(low<=high) { int mid=low+(high-low)/2; // best formula to ignore overflow if(target==a[mid]) return mid; //mid element is the ans else if(a[mid]<target) low=mid+1; //moving to right side else high=mid-1; // moving to left side } return -1; //no value found } :pushpin: VIDEO-TUTORIALS : 1. mycodeschool 2. Errichto 3. AfterAcademy 4. Nick White :pushpin: PDF-TUTORIALS : 1.