GitHub

"# Binary_Search"

while (low <= high) { int mid = low + (high - low) / 2;

if (array[mid] == x)
  return mid;

if (array[mid] < x)
  low = mid + 1;

else
  high = mid - 1;

}

return -1; }

Name		Name	Last commit message	Last commit date
Latest commit History 28 Commits
Binary_Search.cpp		Binary_Search.cpp
Binary_Search.exe		Binary_Search.exe
Binary_Search.py		Binary_Search.py
Find First and Last Position of Element in Sorted Array		Find First and Last Position of Element in Sorted Array
Find Minimum in Rotated Sorted Array		Find Minimum in Rotated Sorted Array
Find Nth Root Of M		Find Nth Root Of M
Find Peak Element		Find Peak Element
First and Last Position of an Element In Sorted Array		First and Last Position of an Element In Sorted Array
Koko Eating Bananas		Koko Eating Bananas
Matrix_BS.cpp		Matrix_BS.cpp
Matrix_BS.exe		Matrix_BS.exe
Number of occurrence		Number of occurrence
README.md		README.md
Rose Garden		Rose Garden
Rotation		Rotation
Search In A Rotated Sorted Array II		Search In A Rotated Sorted Array II
Search In Rotated Sorted Array		Search In Rotated Sorted Array
Search Insert Position		Search Insert Position
Search Insert Position.py		Search Insert Position.py
Single Element in a Sorted Array		Single Element in a Sorted Array
Smallest divisor		Smallest divisor
Smallest_divisor		Smallest_divisor
Square Root of a number		Square Root of a number
ceil_the_floor.cpp		ceil_the_floor.cpp
lower_bound.cpp		lower_bound.cpp
lower_bound.py		lower_bound.py
upper_bound.cpp		upper_bound.cpp
upper_bound.py		upper_bound.py

Provide feedback