1) What is the purpose of using asymptotic notation such as O, Omega and Theta instead of using the exact number of comparisons done by a sorting algorithm? i.e. why do we use O(nA2) instead of saying 2nA2 +3n + 4 Because we are interested in 2) Computing the Average time complexity for a real-world problem is difficult. Explain why this is. Why? 3) Is it possible to find a sorting algorithm that sorts in much less than W(n) Theta(NA2) comparisons which corrects only one bad pair per comparison? Why or why not? Answer: 4) What is the best possible value for W(N) that an algorithm could have for searching an unordered list (i.e. best possible performance in the worst case)? Why? What is the best possible value for W(N) for searching an ordered list? Answer: 5) Name 2 Divide and Conquer algorithmsforsorting we studied in this class. Name Name