Unformatted text preview: the term). Hint 2: Try some small examples (n=1,2,3,4 etc.). (c) Simplify your summation. (d) What is the high order term? (e) Write the worst-case running time in order notation. Problem 2. (a) Write a summation (actually nested summations) for how many comparisons slowsort uses in the average case. (b) Simplify your summation. (c) What is the high order term? (d) Write the average-case running time in order notation....
View Full Document
- Fall '11
- Analysis of algorithms, Computational complexity theory, high order term, Clyde Kruskal