There exist sorting algorithms which can sort any list with N elements in O(N log N) time. True False

How many comparisons would be made for each of the following 3 algorithms if the input is an identical array of size 6. selection sort • insertion sort merge sort

To binary search for a key in a sorted array, the maximum number of comparisons is log2 n. Choose one: Is it true or false?

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