BINARY_SEARCH.txt

//------------------------------------------------------//
//                                                      //
//                                                      //
// SOURCE - https://www.youtube.com/watch?v=GU7DpgHINWQ //
//                                                      //
//                                                      //
//------------------------------------------------------//
1. Finding a target value in a sorted array
a      <- sorted array
target <- represents the target value
PSEUDOCODE:
L = 0, R = N-1
while L <= R
  mid = L + floor((R-L) / 2)
  if a[mid] == target:
    return mid
  if a[mid] < target:
    L = mid + 1
  else:
    R = mid = 1
return -1

2. First value >= target ( Lower bound of target )
PSEUDOCODE:
L = 0, R = N-1
ans = -1
while L <= R:
  mid = L + floor((R - L) / 2)
  if a[mid] >= target:
    ans = a[mid]
    R = mid-1
  else:
    L = mid+1
return ans

3. Rotated array: Somebody rotated( shifted ) a sroted array.
  Find the smallest element
  
4. Find peak: The array increases and then decreases.
  Find the maximum.

5. Sqrt(x) upto some precision