multiple-choice questions the worst case complexity is when compared with the average case complexity of binary search algorithm (aequal (bgreater (cless (dnone of these the complexity of binary search algorithm is (ao( (bo( (co( log (do(log which of the following cases occurs when searching an array using linear search the value to be searched is equal to the first element of the array(aworst case (baverage case (cbest case (damortized case card game player arranges his cards and picks them one by one with which sorting technique can you compare this example(abubble sort (bselection sort (cmerge sort (dinsertion sort which of the following techniques deals with sorting the data stored in the computer' memory(ainsertion sort (binternal sort (cexternal sort (dradix sort in which sortingconsecutive adjacent pairs of elements in the array are compared with each other(abubble sort (bselection sort (cmerge sort (dradix sort which term means sorting the two sub-arrays recursively using merge sort(adivide (bconquer (ccombine (dall of these which sorting algorithm sorts by moving the current data element past the already sorted values and repeatedly interchanging it with the preceding value until it is in its correct place(ainsertion sort (binternal sort (cexternal sort (dradix sort which algorithm uses the divideconquerand combine algorithmic paradigm(aselection sort (binsertion sort (cmerge sort (dradix sort quick sort is faster than (aselection sort (binsertion sort (cbubble sort (dall of these which sorting algorithm is also known as tournament sort(aselection sort (cbubble sort (binsertion sort (dheap sort true or false binary search is also called sequential search linear search is performed on sorted array for insertion sortthe best case occurs when the array is already sorted selection sort has linear running time complexity the running time of merge sort in the average case and the worst case is ( log the worst case running time complexity of quick sort is ( log heap sort is an efficient and stable sorting algorithm external sorting deals with sorting the data stored in the computer' memory insertion sort is less efficient than quick sortheap sortand merge sort the average case of insertion sort has quadratic running time the partitioning of the array in quick sort is done in (ntime fill in the blanks performance of the linear search algorithm can be improved by using the complexity of linear search algorithm is sorting means sort shows the best average-case behaviour deals with sorting the data stored in files ( is the running time complexity of algorithm in the worst caseinsertion sort has running time sort uses the divideconquerand combine algorithmic paradigm in the average casequick sort has running time complexity of the execution time of bucket sort in average case is the running time of merge sort in the average and the worst case is the efficiency of quick sort depends on