2. (10 points) Compute the running time T(n) of the program fragment below and provide an...

  

Transcribed Image Text:

2. (10 points) Compute the running time T(n) of the program fragment below and provide an analysis of the running time (Big-Oh notation will do). For convenience, assume that operations inside for loops take constant time, i.e. (1). sum = 0; for (i=0; i < n; i++) for (j=0; j < i * i; j++) for (k =0; k < j; k++) sum++; 7E 2. (10 points) Compute the running time T(n) of the program fragment below and provide an analysis of the running time (Big-Oh notation will do). For convenience, assume that operations inside for loops take constant time, i.e. (1). sum = 0; for (i=0; i < n; i++) for (j=0; j < i * i; j++) for (k =0; k < j; k++) sum++; 7E