Question

What are the time complexities of some famous algorithms like below:

Binary Search :
Merge Sort:
Insertion Sort:
Quick Sort:
Selective Sort:
Finding max & min for a given set of number:

Answer 1

Please get the time complexities of algorithms:

Binary Search :  O(logn)
Merge Sort:      O(nlogn)
Insertion Sort:  O(n*n)
Quick Sort:      O(nlogn)
Selective Sort:  O(n)

Finding max & min for a given set of number: O(3n/2 -2) 
or if you go strictly or principle then o(3n/2-2) = o(n)