Skip to content

Update 05.md - bug fix in binarySearchClosestStats #4

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
jaredatron wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update 05.md - bug fix in binarySearchClosestStats #4

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: 2 additions & 2 deletions problems/05.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -65,7 +65,7 @@ Using the exercise from above as a template, try introducing [binary search](htt
```js
async function binarySearchClosestStats (core, target) {
let lower = 0
let upper = core.length
let upper = core.length - 1

while (lower < upper) {
const mid = Math.floor((upper + lower) / 2)
Expand Down Expand Up @@ -93,4 +93,4 @@ Take a look at the [solution here](/solutions/05/index.js).
## Takeaways
We'll save the takeways for this exercise until after the next one, when we'll be running these algorithms against larger datasets.

[In Problem 6, we'll scale things up.](06.md)
[In Problem 6, we'll scale things up.](06.md)