CSE 20 Intro to Computing I. Coding

Transcription

1 CSE 0 Intro to Computing I Coding

2 ChooseFunc.java for (int i = ; i <= max;i++ ) { if (func == ) { resarr[i] = resarr[i-] + i; else if (func == ) { resarr[i] = resarr[i-] + i*i; else if (func == ) { if (i == ) resarr[i] = ; else resarr[i] = resarr[i-]*i; else if (func == 4) { if (i == ) resarr[i] = ; else resarr[i] = resarr[i-] + resarr[i-]; else { System.out.println("Error: Do not know " + func); break;

3 ChooseFunc.java : Scope for (int i = ; i <= max;i++ ) { if (func == ) { resarr[i] = resarr[i-] + i; else if (func == ) { resarr[i] = resarr[i-] + i*i; else if (func == ) { if (i == ) resarr[i] = ; else resarr[i] = resarr[i-]*i; else if (func == 4) { if (i == ) resarr[i] = ; else resarr[i] = resarr[i-] + resarr[i-]; else { System.out.println("Error: Do not know " + func); break;

4 Project : Basic arr0, arr, arr, arr [max] avg0, avg, avg, avg For-loop: arr0 avg0 sum Positive numbers count Positive numbers Positive_sum / Positive_count = average For-loop: arr avg For-loop: arr avg For-loop: arr avg For-loop:arr0[j], arr[j], arr[j], arr[j] Print avg0, avg, avg, avg

5 Project : Max+ arr0, arr, arr, arr [max+] Include avg in [max] entry For-loop: arr0 arr0[max] For-loop: arr arr[max] For-loop: arr arr[max] For-loop: arr arr[max] For-loop:arr0[j], arr[j], arr[j], arr[j] Print arr0[max], arr[max], arr[max], arr[max]

6 Project : x4 Array arr [4*max] avg0, avg, avg, avg Or avg[4] array For-loop: i : 0 to For-loop: j : 0 to max- arr[i*max+j] avg[i] For-loop:arr[j], arr[max+j], arr[*max+j], arr[*max+j] Print avg[0], avg[], avg[], avg[]

7 Project : x4 Array arr [4*(max+)] For-loop: i : 0 to For-loop: j : 0 to max- arr[i*(max+)+j] arr[(i+)*(max+)-] // Average For-loop:arr[j], arr[(max+)+j], arr[*(max +)+j], arr[*(max+)+j] Print avg[max], avg[*(max+)-], avg[*(max+)-], avg[4*(max+)-]

8 Array Count n n[] n[] n[] int count = 0; for (j = i + ; j < n.length; j++) count++;

9 Array Count n i=0 n[] n[] n[] j= int count = 0; // count = 0 for (j = i + ; j < n.length; j++) count++;

10 Array Count n i=0 n[] n[] n[] j= int count = 0; for (j = i + ; j < n.length; j++) count++;

11 Array Count n i=0 n[] n[] n[] j= int count = 0; for (j = i + ; j < n.length; j++) count++;

12 Array Count n i=0 n[] n[] n[] j=4 int count = 0; for (j = i + ; j < n.length; j++) count++;

13 n Array Count i=0 OUTPUT: Index 0 repeats 0 n[] n[] n[] j=5 int count = 0; for (j = i + ; j < n.length; j++) count++;

14 n Array Count i= OUTPUT: Index 0 repeats 0 n[] n[] n[] j= int count = 0; // count = 0 (resets) for (j = i + ; j < n.length; j++) count++;

15 n Array Count i= OUTPUT: Index 0 repeats 0 n[] n[] n[] j= int count = 0; for (j = i + ; j < n.length; j++) count++;

16 n Array Count i= OUTPUT: Index 0 repeats 0 n[] n[] n[] j=4 int count = 0; for (j = i + ; j < n.length; j++) count++; // count =

17 n Array Count i= OUTPUT: Index 0 repeats 0 Index repeats n[] n[] n[] j=5 int count = 0; for (j = i + ; j < n.length; j++) count++; // count =

18 n Array Count i= OUTPUT: Index 0 repeats 0 Index repeats n[] n[] n[] j= int count = 0; // count = 0 (resets) for (j = i + ; j < n.length; j++) count++; // count =

19 n Array Count i= OUTPUT: Index 0 repeats 0 Index repeats n[] n[] n[] j=4 int count = 0; for (j = i + ; j < n.length; j++) count++; // count =

20 n Array Count i= OUTPUT: Index 0 repeats 0 Index repeats Index repeats n[] n[] n[] j=5 int count = 0; for (j = i + ; j < n.length; j++) count++; // count =

21 n Array Count i= OUTPUT: Index 0 repeats 0 Index repeats Index repeats n[] n[] n[] j=4 int count = 0; // count = 0 (resets) for (j = i + ; j < n.length; j++) count++;

22 n Array Count i= OUTPUT: n[] n[] n[] Index 0 repeats 0 Index repeats Index repeats Index repeats 0 j=5 int count = 0; for (j = i + ; j < n.length; j++) count++;

23 Array Count n i=4 OUTPUT: n[] n[] n[] j=5 Index 0 repeats 0 Index repeats Index repeats Index repeats 0 Index 4 repeats int count = 0; // count = 0 (resets) for (j = i + ; j < n.length; j++) count++; // count =

24 Array Count n i=5 OUTPUT: n[] n[] n[] Index 0 repeats 0 Index repeats Index repeats Index repeats 0 Index 4 repeats Index 5 repeats 0 int count = 0; // count = 0 (resets) for (j = i + ; j < n.length; j++) // doesn t enter count++;

25 Sample Output int sum = 0, i = 00; int max = 0; for(i = 0;i < max;i++) { System.out.print("Please enter " + i + "num:"); int num = input.nextint(); sum += num; if (i % == 0) System.out.println(num + + sum); int num = 00; System.out.println(num + + i); System.out.println(sum); Please enter 0 number: Please enter number: 9 Please enter number: Please enter number: Please enter 4 number: Please enter 5 number: 5 Please enter 6 number: Please enter 7 number: 7 Please enter 8 number: 4 Please enter 9 number:

26 Array & Scope n 4 n[] n[] int n = {,,,,, 4; for (int i = 0; i < n.length; i++) { for (int j = i + ; j < n.length; j++) System.out.println(i + same as + j); System.out.println(i + second is + j); n[]