provide one example for each common run time complexity:     O(1)  Constant- e.g. Array access      O(log n) logarithmic - e.g. Binary Search       O(n) linear - e.g. Linear Search

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

In Python: Let n be a (large) positive integer of your choice. We want to know which of the two Quicksort algorithms methods (he Lomuto method and the Hoare method) is superior when sorting arrays containing n elements. To answer this question, you will run Quicksort on 10000 random permutations of [1,2,3, . . . , n], on each of your two Quicksort algorithms.

Select all the statements that are false, bubble sort is defined below:*             Quicksort is the fastest sorting algorithm         If you are lucky, you can get O(n) time complexity in Mergesort         On the worst case, Bubble sort will give you O(n logn) time complexity         Average time complexity of insertion sort is much better than bubble sort         Selection sort has the worst space complexity among all the sorting algorithm