What is the time complexity (big-O) for the code fragment shown below? void methodA() { for...

Transcribed Image Text:

What is the time complexity (big-O) for the code fragment shown below? void methodA() { for (int i = 0; i<n; i++) int x = methodB(); } int methodB() { } for (int i = 1; i < n; i = i*2) System.out.println("The number is " + i); return (1²); What is the time complexity (big-O) for the code fragment shown below? void methodA() { for (int i = 0; i<n; i++) int x = methodB(); } int methodB() { } for (int i = 1; i < n; i = i*2) System.out.println("The number is " + i); return (1²);

Answer rating: 100% (QA)

The code snippet provided contains two methods methodA and methodB To calculate the time ... View the full answer