Linear Search algorithm requires ____________ comparison(s) if the searching element is not found in an array A of size n.

Consider Merging Two Sorted List algorithm. If we want to implement this algorithm for the array A={1,3,4,5,6,8,9,0,2,7}, what is the value of x,y, and z.

Consider Merging Two Sorted List algorithm. The least number of comparisons occurs when the elements of the smaller subarray are less than all entries in the larger subarray. For the array A={1,3,4,5,6,8,9,0,2,7}, are the elements of the smaller subarray less than all entries in the larger subarray.

Given an array A={1,3,4,6,7,9,12,15}. What is the second element to be compared when searching for 0.

What is the time complexity of the following algorithm?

The least significant bit Radix sort algorithm is _________________ for both time and space complexities.

The average case time complexity of the Quicksort algorithm is _________________.

We study algorithms to choose the best time-space complexity to solve a particular

problem in the most __________________ way possible.

The average case time complexity of the Selection sort is ___________________.

One limitation of Binary Search algorithm is that the array elements must be ___________________.