(a) (n2 +1)2/n(b) (n2 + log2n)2 / n(c) n3 + 100n2 + n(d) 2n + 100n2 + 45n (e) n2n + n22n(a)int count =1;while (count <30) { count = count *2;}(b)int count =15;while (count <30) { count = count *3;}(c)int count =1;while (count < n) { count = count *2;}(d)int count =15;while (count < n) { count = count *3;}
(a)for (int i =0; i < n; i++) { System.out.print('*');}(b)for (int i =0; i < n; i++) {for (int j =0; j < n; j++) { System.out.print('*'); }}(c)for (int k =0; k < n; k++) {for (int i =0; i < n; i++) {for (int j =0; j < n; j++) { System.out.print('*'); } }}(d)for (int k =0; k <10; k++) {for (int i =0; i < n; i++) {for (int j =0; j < n; j++) { System.out.print('*'); } }}
(a)publicstaticvoid mA(int n) {for (int i =0; i < n; i++) { System.out.print(Math.random()); }}(b)publicstaticvoid mB(int n) {for (int i =0; i < n; i++) {for (int j =0; j < i; j++) System.out.print(Math.random()); }}(c)publicstaticvoid mC(int[] m) {for (int i =0; i < m.length; i++) { System.out.print(m[i]); }for (int i = m.length -1; i >=0; ) { System.out.print(m[i]); i--; } }(d)publicstaticvoid mD(int[] m) {for (int i =0; i < m.length; i++) {for (int j =0; j < i; j++) System.out.print(m[i] * m[j]); }}
for (int i =0; i < list.length -1; i++) {if (list[i] > list[i +1]) { swap list[i] with list[i +1]; i =-1; }}
int gcd =1;for (int k = Math.min(Math.sqrt(n), Math.sqrt(m)); k >=1; k--) {if (m % k ==0 && n % k ==0) { gcd = k;break; }}