The complexity of both methods (Method 1 and Method2) are O(n) public void Method1() 1 for(int...

 

Transcribed Image Text:

The complexity of both methods (Method 1 and Method2) are O(n) public void Method1() 1 for(int i=1;i < n; i++) for(int z=1; 2 < n; z++) } System.out.println(z): System.out.println("Hello"); public void Method2() for(int i=1; i The complexity of both methods (Method 1 and Method2) are O(n) public void Method1() 1 for(int i=1;i < n; i++) for(int z=1; 2 < n; z++) } System.out.println(z): System.out.println("Hello"); public void Method2() for(int i=1; i

Answer rating: 100% (QA)

In both Method1 and Method2 we have loops that run with an upper bound o... View the full answer