In each part, indicate the order of the given operation, using big-Oh and, based on this, in words (e.g. logarithmic, linear etc). Assume that a good algorithm is used, within the constraints given. Use n to denote the size of the input.
a. Find an item with a given value in a sorted array.
Big-Oh:
In Words:
b. Print the middle item in an array of known size.
Big-Oh:
In Words:
c. Print the middle item in a Linked List of known size.
Big-Oh:
In Words:
d. Sort an array with Quicksort.
Big-Oh:
In Words:
e. Sort a Linked List.
Big-Oh:
In Words: