Rizq Technology – Exploring Your iDea.

Lanjutan dari series Java#0 , Java#1 , Sekarang kita ke Bab selanjutnya yaitu mengenai Array di Java. Berikut cuplikan programnya.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Bab7 {

    public static void tugas7_1(){

        String days[] = {"Monday","Tuesday","Wednesday","Thurday","Friday","Saturday","Sunday"};
        int x = 0, y = 0;

        System.out.println("===WD===");
        while(x < days.length){
            System.out.println(days[x]);
            x++;
        }

        System.out.println("===DW===");

        do {
            System.out.println(days[y]);
            y++;
        }
        while(y < days.length);

        System.out.println("===FL===");

        for(int z=0; z < days.length; z++){
            System.out.println(days[z]);
        }

    }

    public static void tugas7_2(){

        BufferedReader dataIn = new BufferedReader(new InputStreamReader(System.in));
        String n1="";
        int maks[] = new int[10];
        int maxValue = maks[0];
        int c=1;

         try {

            for(int x=0; x < maks.length; x++){
                System.out.print("Masukan Nilai Ke "+c+" : ");
                n1 = dataIn.readLine();
                int y = Integer.parseInt(n1);
                maks[x] = y;
                c++;

                if(maks[x] > maxValue){
                     maxValue = maks[x];
                }

            }

             System.out.println("Nilai Maksimum adalah "+maxValue);

        }catch(IOException e){
            System.out.println("An Error Occurred");
        }

    }

    public static void tugas7_3(){

        String entry[][] = {{"Florence","753-1234","Manila"},{"Joyce","248422","Quozon City"},{"Becca","5485-4411","Manila"}};

        for(int x=0; x < entry.length; x++){

            System.out.println("Name : "+entry[x][0]);
            System.out.println("Tel. # : "+entry[x][1]);
            System.out.println("Address : "+entry[x][2]);

        }

    }

    public static void tugas7_4(){

    int[][]arr=new int[2][5];
        int k=1;

        for(int i=0; i5)arr[i][j]=16-k;
                System.out.print(arr[i][j]);
                if (j<5) System.out.print(" ");
                k++;
             }
            System.out.println();
            }

        //Outputnya::::::
        //1 2 3 4 5
        //10 9 8 7 6
    }

}

• Follow us on Twitter, or subscribe to the rizqtech RSS Feed for more daily web development and articles.

Enjoy this Post!