Program Searching pada Java STMIK AKAKOM YOGYAKARTA

SEARCHING
PERTEMUAN KE -07

1. buble sort

code: 

public class BinarSearch{

public static void main(String[]arg){

int batasAtas,batasBawah,index,cari,posisiSekarang;

int[]array = new int[5];

array[0] = 25;

array[1] = 30;

array[2] = 40;

array[3] = 45;

array[4] = 50;

batasAtas = array.length-1;

batasBawah = 0;

for(index=0;index<array.length;index++){

System.out.print(array[index]+ " ");

}

System.out.println("");

cari = 30;

boolean belumKetemu = true;

while(belumKetemu){

posisiSekarang = (batasAtas + batasBawah)/2;

if(array[posisiSekarang]== cari){

belumKetemu = false;

System.out.println("ditemukan " + cari);

}else if(batasBawah > batasAtas){

System.out.println("ditemukan " + cari);

break;

}else{

if(array[posisiSekarang]< cari){

batasBawah = posisiSekarang +1;

}else{

batasAtas = posisiSekarang = 1;

}

}

}

}

}

output

2. Selecetion Sort

import java.util.Scanner;

public class selection_sort1

{

static int [] x=new int [100];

static int i,j,index,large,n;

public void input()

{

Scanner MyScanner=new Scanner(System.in);

System.out.print("Masukkan berapa banyak data yang ingin dimasukkan = ");

n=MyScanner.nextInt();

for(i=0;i<n;i++)

{

System.out.print("Masukkan data "+(i+1)+" = ");

x[i]=MyScanner.nextInt();

}

}

public void sort()

{

for(i=n-1;i>0;i--)

{

large=x[0];

index=0;

for(j=1;j<=i;j++)

{

if(x[j]>large)

{

large=x[j];

index=j;

}

}

x[index]=x[i];

x[i]=large;

}

System.out.println();

}

public static void main(String[]args)

{

selection_sort1 ok=new selection_sort1();

ok.input();

ok.sort();

System.out.print("Data yang sudah urut = ");

for(i=0;i<n;i++)

{

System.out.print(x[i]+" ");

}

System.out.println();

System.out.println();

}

}

output