5. If a given Qin logn) algorithm runs in 60 ms for an input of size...

Transcribed Image Text:

5. If a given Qin logn) algorithm runs in 60 ms for an input of size 32, what would the expected run- time be for an input size of 64? 6. Find the run time function [T(n)] and complexity of the following code segment: for (i = 1; i <= n*n; į++) for (j= 1; j<= 5* n; i++) count++; for (i = 1; i <= 3* n; i++) count++; 5. If a given Qin logn) algorithm runs in 60 ms for an input of size 32, what would the expected run- time be for an input size of 64? 6. Find the run time function [T(n)] and complexity of the following code segment: for (i = 1; i <= n*n; į++) for (j= 1; j<= 5* n; i++) count++; for (i = 1; i <= 3* n; i++) count++;

Answer rating: 100% (QA)

The image contains two separate questions one about the expected run time of an algorithm for a diff... View the full answer