Skip to content

Latest commit

 

History

History
 
 

11_Binary-Search

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
01. Allocate Minimum Number Of Pages.py
01. Allocate Minimum Number Of Pages.py
 
 
02. Split Array Largest Sum.py
02. Split Array Largest Sum.py
 
 
03. Capacity To Ship Packages Within D Days.py
03. Capacity To Ship Packages Within D Days.py
 
 
04. Median of Two Sorted Arrays.py
04. Median of Two Sorted Arrays.py
 
 
05. Find Peak Element.py
05. Find Peak Element.py
 
 
06. Valid Triangle Number.py
06. Valid Triangle Number.py
 
 
07. Kth Smallest Element in a Sorted Matrix.py
07. Kth Smallest Element in a Sorted Matrix.py
 
 
08. Find K Closest Elements.py
08. Find K Closest Elements.py
 
 
09. Koko Eating Bananas.py
09. Koko Eating Bananas.py
 
 
10. Maximum Number of Removable Characters.py
10. Maximum Number of Removable Characters.py
 
 
11. Kth Missing Positive Number.py
11. Kth Missing Positive Number.py
 
 
12. Minimum Time to Complete Trips.py
12. Minimum Time to Complete Trips.py
 
 
13. Missing Number In Arithmetic Progression.py
13. Missing Number In Arithmetic Progression.py
 
 
Aggressive Cows - Advanced Binary Search.py
Aggressive Cows - Advanced Binary Search.py
 
 
Allocate Minimum Number Of Pages.py
Allocate Minimum Number Of Pages.py
 
 
EKO - Max Height of cut to get atleast M amount of wood.py
EKO - Max Height of cut to get atleast M amount of wood.py
 
 
Find Minimum in Rotated Sorted Array.py
Find Minimum in Rotated Sorted Array.py
 
 
K-th element of two sorted Arrays.py
K-th element of two sorted Arrays.py
 
 
Median of Row Wise Sorted Matrix.py
Median of Row Wise Sorted Matrix.py
 
 
Median of Two Sorted Arrays.py
Median of Two Sorted Arrays.py
 
 
Minimum Cost to Make Array Equal.py
Minimum Cost to Make Array Equal.py
 
 
Painters Partition Problem.py
Painters Partition Problem.py
 
 
Search in Rotated Sorted Array.py
Search in Rotated Sorted Array.py
 
 
Single Element in a Sorted Array.py
Single Element in a Sorted Array.py
 
 
The N-th root of any number.py
The N-th root of any number.py
 
 
readme.md
readme.md
 
 

readme.md

Binary Search

We should write mid = start + (end - start)//2 because in some test cases mid = (start + end)//2 may give Integer Overflow Error

or,

mid = (low + high) >> 1
right shift by 1 bit