Know the big O notation for linear search, binary search, selection sort, and merge sort. Be able to rank these algorithms in terms of complexity.

Please justify your answer: Some sorting algorithms require extra space, apart from the space needed for the original  array that needs to be sorted. Which one of the following statements on the space usage of  sorting algorithms is correct?  a.)  A Heapsort for sorting an array of size N requires an amount of extra space proportional  to N.   b.)  Insertion Sort for sorting an array of size N requires an amount of extra space  proportional to N.   c.)  Merge sort for sorting an array of size N requires an amount of extra space proportional  to N.   d.) Quicksort for sorting an array of size N requires an amount of extra space proportional  to N.   e.) None of the above

What is the time complexity (in big-O notation) of binary search in a sorted array containing m (m >0) numbers? Why is the insertion not supported for unsorted array? What are the fundamental operations of an unsorted array?