Devise an algorithm that matches the lower bound, i.e., sorts a list in which each paper is within k slots of its proper position in e (n log k) time. Hint: Se Exercise 6.5-8 on page 166 of Introduction to Algorithms, Third Edition.

A sequential search of a sorted list can halt when the target is less than a given element in the list. Define a modified version of this algorithm and state the computational complexity, using big-O notation, of its best-, worst-, and average- case performances.

Define and justify why stopping conditions are required for all recursive algorithms, such as the recursive binary search, in your own words.

Please show and explain so I can nderstand.

Consider the following algorithms. Each algorithm operates on a list containing n elements, where nis a very large integer. I. An algorithm that accesses each element in the list twice II. An algorithm that accesses each element in the list n times III. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list Which of the algorithms run in reasonable time? A I only B III only I and II only D I, II, and II

Performing sequential search for an item that is not present in an unsorted list has Best-Case running time equals to:           1     log(n)     n     n2

Please help with question: Determine the running time of the following algorithms. Write summations to represent loops and simplify. Show all work. If bounding is used, the upper and lower bounds must only differ by a constant.  Note:  This is not the line-by-line analysis method. Loops are inclusive.