The best case for a binary search is finding the target item on the first look into the data structure, so O(1). The worst case for a binary search is searching for an item which is not in the data....
Short answer.
Best case: O(n) Worst case: O(n2)
Long answer.
Let's assume we're sorting data in an array of length n. Let's also assume that we're sorting in ascending order (low-high). The worst...