Problem
Consider the following algorithm:
(a) What is the best case time complexity of the algorithm (assuming n > 1)?
(b) What is the worst case time complexity of the algorithm?
(c) Try to improve the efficiency of the algorithm.
(d) What property holds for the array A if the algorithm returns 0?
(e) What property holds for the array A if the algorithm returns 1?