Bifalgorithm post
Now we are able to have this data set 1579 all this. Let's take the middle value. This is the middle value. Let's say I want to search for element 61. I want to search for element 61. So in order to search for element 61, now we are going with 13 as the middle value. So 13, is it greater than 61? The answer is no. So 13 is not greater than 61. So which is less than 61. So then what we will be doing, we will are going towards the right-hand side again we are going to the center value. Now this 58 is it greater than 61 again the condition is pause again we are trying to look for your particular right-hand side again on the right-hand side we are going to 63 so 63 is it greater than
Now we are able to have this data set 1579 all this. Let's take the middle value. This is the middle value. Let's say I want to search for element 61. I want t…
Ideas in this flowchart
- Search for Element 61
- Initial Middle Value
- Middle Value: 13
- Is 13 > 61?
- No
- Move Right
- New Middle Value
- Middle Value: 58
- Is 58 > 61?
- Move Right Again
- Middle Value: 63