Theweekweek. Powered by Blogger.
RSS

Program Insertion Sort Dengan JAvaa

import java.util.Scanner;

public class insertionSort {

public int CariPosisi(int arr[], int search) {
boolean ketemu = false;
int i = 0;
int posisi = 0;
while((!ketemu) && (i < arr.length)) {
if(search == arr[i]) {
ketemu = true;
posisi = i + 1; break;
}
i++;
}
if(!ketemu) {
System.out.println("Bilangan Gak Ada!");
}
return posisi;
}


public static void main(String args[]) {
Scanner in = new Scanner(System.in);
insertionSort baru = new insertionSort();

int data[] = new int[10];
//inputan data
System.out.println("Masukkan 10 Bilangan !");
for(int i = 1; i <= data.length; i++) {
System.out.print("Bilangan ke-"+i+" : ");
data[i-1] = in.nextInt();
}
//sorting
for(int i = 1; i < data.length; i++) {
int simp = data[i];
int j = i;
while((j > 0) && (simp < data[j - 1])) {
data[j] = data[j - 1];
j--;
}
data[j] = simp;
}
//menampilkan data setelah di sorting
for(int i = 0; i < data.length; i++) {
System.out.print(data[i]+" ");
}
System.out.println();
System.out.print("Bilangan Yang Dicari : ");
int cari = in.nextInt();
if(baru.CariPosisi(data, cari) > 0) {
System.out.println("Ada di posisi : "+baru.CariPosisi(data, cari));
}
}
}

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

0 komentar:

Post a Comment