Analysis of algorithm

tut1.pdf 1 of 2 90,09% Analysis of Algorithms 1. Algorithms (a) What is the complexity of the linear search algorithm in the worst case? How would we go about calculating the average case comple (b) What is the complexity of the binary search algorithm in the worst case? (c) What configuration of input is best for the binary search algorithm? (d) Is it possible for linear search to take less time to complete than binary search xity? for particular input sets? (e) What is the purpose of experimern ental analysis? How would you perform an experimental analysis on the linear search algorithm? (f) What is the time complexity of the following algorithm in the best case? In the worst case? public void calculateValue(int itens) int total-0; for (int i-0: i