Perform a detailed complexity analysis of the main method. In this case, it is necessary to analyze the complexity of the methods sub1 and sub2. Use asymptotic notation to indicate the best and worst...

Perform a detailed complexity analysis of the main method. In this case, it is necessary to analyze the complexity of the methods sub1 and sub2. Use asymptotic notation to indicate the best and worst case. The size() method returns the number of elements in a list.= 0; i--){ x = (double)i/2; y = (double)x/2; z = System.out.print(z); } %3D (double)x+y; } "/>
Extracted text: public void main(ArrayList args){ sub1( ); double x, у, z; for(int i = (1000 + args.size( )); i >= 0; i--){ x = (double)i/2; y = (double)x/2; z = (double)x+y; System.out.print(z); } sub2(args); } public void sub1( ){ double x, у, 2; for(int i = 1000; i >= 0; i--){ x = i/2; y = x/2; z = x+y; System.out.print(z); } } public void sub2(ArrayList args ){ for(int i = 0; i < math.pow(args.size(),="" 10);="" i++){="" system.out.println(="" "hello="" world");="" }="" for(int="" i="0;" i="">< args.size();="" i++){="" system.out.print(args.get(i));="" }="" double="" x,="" у,="" z;="" for(int="" i="1000" +="" math.pow(args.size(),="" 10);="" i="">= 0; i--){ x = (double)i/2; y = (double)x/2; z = System.out.print(z); } %3D (double)x+y; }