Skip to content

Updated finding mid in Binary Search in the file Book_Allocation.md #11

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ritwik1503 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Updated finding mid in Binary Search in the file Book_Allocation.md #11

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion Binary Search/Book_Allocation.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,9 @@ int findMinPages(int *books,int n,int k){
int ans = INT_MAX;

while(s<=e){
mid = (s+e)/2;
//Mid should be considered like this in order to avoid Integer overflow that can be caused.
// If both s and e are INT_MAX. If we take mid = (s+e)/2 , this will cause overflow and give WA.
mid = s + (e-s)/2;

if(isValid(books,n,k,mid)){
ans =
Expand Down