Analyze the running time of the code fragments below. For simplicity, assume that n is a...

  

Transcribed Image Text:

Analyze the running time of the code fragments below. For simplicity, assume that n is a power of 2. for (i = 1; i < n; i++) { j = n; while (j = 1) { // body of the while loop j = lj/2] // requires (1) time. } Analyze the running time of the code fragments below. For simplicity, assume that n is a power of 2. for (i = 1; i < n; i++) { j = n; while (j = 1) { // body of the while loop j = lj/2] // requires (1) time. }