7. What is the time complexity of the following code in terms of big U hotation? int i; cin >>n; i=1; while (i

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 12PE
icon
Related questions
Question

Whats is the solution of this exercise?

7. What is the time complexity of the following code in terms of big O notation?
int i;
cin >>n;
i = 1;
while (i<n){
i=1*2;
System.out.println(i);
a) O(n)
b) O(nlog n)
o(n²)
d) O(log n)
Transcribed Image Text:7. What is the time complexity of the following code in terms of big O notation? int i; cin >>n; i = 1; while (i<n){ i=1*2; System.out.println(i); a) O(n) b) O(nlog n) o(n²) d) O(log n)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Declaring and Defining the Function
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning