text: If x is present in arr [ low ... high ] then returns the index of first occurrence of x , otherwise returns - 1
code: static int _binarySearch ( int arr [ ] , int low , int high , int x ) { if ( high >= low ) { int mid = ( low + high ) / 2 ;