Find minmax,Merge sort,Quicksort, Binary search

1. BET_ADA_2_Textbook
Monday, November 29, 2021 1:13 AM
General Page 1

2. Best case/Worstcase/AvgCase O(NlogN)
Already sorted numbers and unsorted numbers , both take same
Best case/Worstcase/AvgCase O(N)
General Page 2

3. Worst case O(logN) Element not found or
Element at 0 index or
Element at last index
Best case O(1) Found at mid index
Average case O(NlogN) Element is between 1st and mid index or
Element is between mid and last index
Best case/AvgCase O(NlogN)
Worstcase (if elements are in already sorted order) O(N^2)
General Page 3

4. General Page 4