Describe step-by-step how Binary Search locates a target value in a sorted array. Why does it fail if the array is unsorted?
Describe step-by-step how Binary Search locates a target value in a sorted array. Why does it fail if the array is unsorted?
From the Combined Bank Assistant Programmer (CSE) January 2026 – Written exam, question 7 of 22.
More from this paper
- Previous: What is Version Control (e.g., Git)? Explain the specific difference between "Committing" code and "Pushing" code.
- Next: You have two stacks. Explain the logic required to implement a Queue (FIFO) using only these two stacks.
- All questions in Combined Bank Assistant Programmer (CSE) January 2026 – Written