In Binary Search , which will be the scenario for Worst Case performance ?
The ‘input key’ is not present in the list O(logn).
The ‘First key’ is not present in the list O(logn).
The ‘last key’ is not present in the list O(logn).
The ‘mid key’ is not present in the list O(logn).
0 comments:
Post a Comment