0
What is the condition for binary search to be unsuccessful where Beg is the beginning and End is ending location of sorted array?
- AEnd > Beg
- BEnd != Beg
- CEnd < Beg
- DEnd == Beg
Correct answer: C
What is the condition for binary search to be unsuccessful where Beg is the beginning and End is ending location of sorted array?