-
Notifications
You must be signed in to change notification settings - Fork 49
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.
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
Daniela Sanchez - Leaves #41
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Not bad, you do have some issues especially with binary search. Take a look at your code and my pseudocode. Try to figure out what's going on.
|
||
until array[index] == nil | ||
array[index] | ||
index += 1 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Do you need two variable?
|
||
while array[middle] != value_to_find | ||
if array[middle] < value_to_find | ||
start = middle + 1 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You should also recalculate middle if array[middle] < value_to_find
if array[middle] < value_to_find | ||
start = middle + 1 | ||
else array[middle] > value_to_find | ||
middle = (start + middle - 1)/2 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You also need to keep track of the end as well as the start. This isn't quite right.
:)