Question: - Explain in detail how you would change the binary search algorithm in a given random array (that has a sequence of Os followed by

- Explain in detail how you would change the binary search algorithm in a given random array (that has a sequence of Os followed by 1s) to find where exactly Os and 1s splits. Call the position of the split K. (Example: Input1: a = [0011111] output1: K = 2 Input2: a = [000000 1] output2: K =6)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
