Question

For each of the following six program fragments: a. Give an analysis of the running time (Big-Oh will do). b. Implement the code in the language of your choice, and give the running time for several values of N. Pseudo Code Implementation Analysis of runtime time (Big-Oh) (1) sum = 0; for(i = 0; i < n; ++i) ++sum; (2) sum = 0; for(i = 0; i < n; ++i) for(j = 0; j<n; ++i) ++sum; (3) sum = 0; for(i=0;i<n; ++i) for(j = 0; j<n n; ++i) .sum; (4) sum = 0; for(j = 1. j <= 10; i++) sum sum + 4 for (i = 1; i <= n;i++) for(j = 1:<= 20; i++) sum sum + + (5) sum = 0; for(i=0;i<n; ++i) for - 0; j < 1; ++i) ++sum; (6) long fiblong index) { if (index == 0) // base return 0; else if (index == 1) //base return 1: else //Reduction/recursive return fib(index - 1) + fib(index - 2); } 171 cm

Answer 1

1.) O(n)

time taken: 0 sec.

memory: 1.47 MB

2.) O(n^2)

time taken: 0 sec

memory: 1.4 MB

3.) O(n^3)

time taken: 0 sec

memory: 1.3 MB

4.) O(n)

time taken: 0.6 sec

memory: 1.470496 MB

5.) O(n^2)

time taken: 0.54 sec

memory: 1.470496 MB

6.) O(2^n)

time taken: 0 sec

memory: 1.470496 MB

7.) O(n^4)

time taken: 0 sec

memory: 1.470496 MB