121) Which of the following sorting algorithms does not have a worst case running time of O(n2)

122) For a linear search in an array of n elements the time complexity for best, worst and average case are ......., ....... and ........ respectively

123) The average time required to perform a successful sequential search for an element in an arrayA(1 : n) is given by

124) Using the standard algorithm, what is the time required to determine that a number n is prime

125) The average time required to perform a successful sequential search for an element in an arrayA (1 : n) is given by