In each of the following pseudocode program segments, the integer variables i, j,n, and sum are declared earlier in the program. The value of n (a positive integer) is supplied by the user prior to execution of the segment. In each case we define the time-complexity function f(n) to be the number of times the statement sum : = sum + 1 is executed. Determine the best "big-Oh" form for f.

Transcribed Image Text:

a) begin sum0 for i- 1 to n do for j 1 to n do sumsum 1 end while i 0 do begin sum := sum + 1 end end e) begin sum := 0 for i := 1 to n do begin while j 0 do begin sum := sum + 1 end end end