hw9part3.txt

This file is for your write up of the final three problems:

(A)  The analysis and resulting big-O runtime of

for (int i=1 ; i≤n ; i *= 2)
    for (int j=0 ; j<i ; ++j)
        // constant time work here















(B)  The analysis and resulting big-O runtime of

for (int i=1 ; i≤n ; ++i)
    for (int j=1 ; j<i ; j *= 2)
        // constant time work here











(C)  The recurrence relation, the analysis ("unwinding") and the big-O run time of the StoogeSort algorithm in the assignment.













(D)  [Optional, extra-credit]    The recurrence relation, the analysis ("unwinding") and the big-O run time of the _Improved_ StoogeSort algorithm in the assignment!













