Question: 1.) (25 points each) Write down a summation version of the run-time of each of the following two algorithms and then figure out and prove


1.) (25 points each) Write down a summation version of the run-time of each of the following two algorithms and then figure out and prove the asymptotic complexity (-set) of that run-time function. (a) FUNCTION Wa(nN) x0i1WHILEin2DOx++i5iRETURN(x) (b) FUNCTION Wb(nN) x0FORi1TOn2DOj3WHILEjiDOx++j2j (c) FUNCTION Wc(nN) x0inWHILEi>1DOFORj1TOn2DOx++ii/2REtURN(x) 1 (d) FUNCTION Wd(nN) x0i0WHILEi
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
