Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Conversation

@mandakini-tech
Copy link

Corrected the Binary Search explanation in the Decrease and Conquer chapter.

  • If nums[mid] < target → move right (l = mid + 1)
  • If nums[mid] > target → move left (r = mid - 1)

Resolves #15

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Binary Search wrong description

1 participant