A binary search is a very simple, but powerful search algorithm. If you know that a solution exists between two limits, and if you have a way to test whether a guess is too high or too low, then a binary search can be used.Can someone explain to me how a binary search works? In context of trying to refine the roots of a function to get more precise values.
Thanks
Thread starter | Similar threads | Forum | Replies | Date |
---|---|---|---|---|
Z | Binary Search Understanding & Running Time calculation line by line | Homework Help | 13 | |
Z | Search a Binary Search Tree | Homework Help | 8 | |
Z | Nummber of Comparisons in Binary Search (worst Case) | Homework Help | 3 | |
Z | Binary search trees from node | Homework Help | 35 | |
C | Binary search Matlab | Programming & Languages | 0 |
by Aaron Carman
by Jeff Child
by Jeff Child