Saved Bookmarks
| 1. |
Provide A Short Description Of Binary Search Algorithm.? |
|
Answer» Binary search algorithm always chooses the MIDDLE of the remaining search space, discarding one HALF or the other, again depending on the comparison between the key value FOUND at the estimated POSITION and the key value sought. The remaining search space is reduced to the part before or after the estimated position. Binary search algorithm always chooses the middle of the remaining search space, discarding one half or the other, again depending on the comparison between the key value found at the estimated position and the key value sought. The remaining search space is reduced to the part before or after the estimated position. |
|