Binary search algorithm

• Best case : O(1)

• Worst case : O(log2N)

• Average Case : O(log2N)/2 = O(log2N)

Previous slide

Next slide

Back to first slide

View graphic version