Bifalgorithm post
high will be equal to mid minus one say binary search is to be called and here I pass one two three four five the basic restriction is that the array must be sorted and we had five search three in it we found that it is in the index position two that's it goodbye
high will be equal to mid minus one say binary search is to be called and here I pass one two three four five the basic restriction is that the array must be s…
Ideas in this flowchart
- Binary Search Process
- Array Requirement
- Array Must Be Sorted
- Binary Search Execution
- Initial Call
- Parameters: 1, 2, 3, 4, 5
- Search for Element
- Element: 3
- Found at Index
- Index: 2
- Adjust Search Range
- High = Mid - 1
