118) The time complexity of linear search algorithm over an array of n elements is

119) The time required to search an element in a linked list of length n is

120) The worst case time required to search a given element in a sorted linked list of length n is

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