java

package array;
import java.util.*;
public class Array {
    public static void main(String[] args) {
        int [] fredy = new int [10];
        Integer [] yohanes = {9,3,8,7,2};

        fredy[1]=5;
        fredy[3]=7;
        fredy[8]=3;


        int i = 0 ;
        for ( i = 0 ; i < fredy.length ; i++)
            System.out.print(fredy[i] + " ");
        System.out.println();

        for ( i = 0 ; i < yohanes.length ; i++)
            System.out.print(yohanes[i] + " ");

        System.out.println();

        System.out.println(Arrays.toString(fredy));
        System.out.println();
        System.out.println(Arrays.toString(yohanes));
        System.out.println();
        Arrays.sort(yohanes);
        System.out.println(Arrays.toString(yohanes));
        System.out.println();
        Arrays.binarySearch(fredy, 5);

        Arrays.sort(yohanes, Collections.reverseOrder());
        System.out.println("Besar ke kecil");
        for (Integer yohane : yohanes) {
            System.out.println(yohane); //data1 = fredy , data2 = yohanes
        }




        }

}








package array;
import java.util.*;
public class LatSearch {
    public static void main (String [] args){
        sequential();
        System.out.println(" ");
        binarysearch();
    }
    public static void sequential (){

       int [] wildan = {1, 2, 4, 8, 12};


        System.out.println(Arrays.toString(wildan));

        //metode Sequential Search

        boolean ketemu = false ; int x = 8;
        for (int i = 0 ; i < wildan.length ; i++){
            if (wildan[i] == x)
                ketemu = true;
        }
        if  (ketemu)
            System.out.println("Data ditemukan");

        else
            System.out.println("Data tak ditemukan");
    }

    public static void binarysearch(){
          int arr[] = {10,20,30,40,50};
        int key = 10;
        int result = Arrays.binarySearch(arr,key);
        if (result < 0)
            System.out.println("Data tidak ketemu");
        else
            System.out.println("Data ketemu di: "+result);
    }

    }