4. Pick the correct time complexity in Big O notation for the following blocks of code...

Transcribed Image Text:

4. Pick the correct time complexity in Big O notation for the following blocks of code and JUSTIFY (Proper Explanation) your answer: for (p=E; p>0; p/= 2) { sequence of statements of 0(1) } m = 0; while (m <C) { for (n = 0; n <D; n++) { sequence of statements of O(1) } m++; ************ == i) 0(E^2)+O(C*D) O(D^C) + 0(E*2) O(E) + O(log(CD)) O(C*D)+O(log E) I 4. Pick the correct time complexity in Big O notation for the following blocks of code and JUSTIFY (Proper Explanation) your answer: for (p=E; p>0; p/= 2) { sequence of statements of 0(1) } m = 0; while (m <C) { for (n = 0; n <D; n++) { sequence of statements of O(1) } m++; ************ == i) 0(E^2)+O(C*D) O(D^C) + 0(E*2) O(E) + O(log(CD)) O(C*D)+O(log E) I

Answer rating: 100% (QA)

Lets analyze the time complexity of the given code block... View the full answer