Welcome

zwani.com myspace graphic comments
Ojo Rumongso iso, nanging iso o Rumongso

Rabu, 14 Desember 2011

Contoh Algoritma Sorting (JAVA)

1. Bubble Sort Normal angka

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Arshie-LU4E
 */
public class bubblesort {
 public static void main(String[] args)
{   int[] x = {29,13,10,7,34,21,4,54,30};
int i, temp, j;
System.out.println("Sebelum diurutkan :");
for(i=0;i
    System.out.print(x[i]+"\t");
    System.out.println("\n");
for(i=0;i
{
    for(j=0;j
    {
        if(x[j] > x[j+1])
        {
            temp = x[j];
            x[j] = x[j+1];
            x[j+1] = temp;
        }
    }
    for(int k=0;k
        System.out.print(x[k]+"\t");
        System.out.println();
}
System.out.println("Setelah diurutkan :");
for(i=0;i
System.out.print(x[i]+"\t");
}
}

2. Pengurutan String

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Arshie-LU4E
 */
import java.util.*;

public class SortingNama
{
public static void main(String args[])
{
System.out.print("Masukkan Banyak Data : ");
int n = inputAngka();

String nama [] = new String [n];
String nama2 [] = new String [n];
String nama3 [] = new String [n];
for (int i=0;i
{
System.out.print("Nama ke-"+(i+1)+" = ");
nama [i]=nama2 [i]= nama3 [i]=inputNama();
}

bubbleSort(n,nama);tampilB(n,nama);
selection(n,nama2);tampilS(n,nama2);
insert(n,nama3);tampilI(n,nama3);
}
public static int inputAngka()
{
Scanner papan = new Scanner(System.in);
int a = papan.nextInt();
return a;
}
public static String inputNama()
{
Scanner papan = new Scanner(System.in);
String a = papan.next();
return a;
}
public static void bubbleSort(int n,String nama[])
{
for(int i=0;i
for(int j=n-1;j>i;j--)
{
if(String.CASE_INSENSITIVE_ORDER.compare(nama[j],nama[j-1])<0)
{
String temp = nama[j];
nama [j] = nama[j-1];
nama [j-1] = temp;
}
}
}
public static void selection(int n, String nama2[])
{
for(int i=0;i
{
int min = i;
for(int j=i+1;j
{
if(String.CASE_INSENSITIVE_ORDER.compare(nama2[min],nama2[j])>0)
min = j;
}
String temp = nama2[min];
nama2[min] = nama2[i];
nama2[i]= temp;
}
}
public static void insert(int n, String nama3[])
{
for(int i=1;i
{
int j;
String temp = nama3[i];
for(j=i;j>0&&String.CASE_INSENSITIVE_ORDER.compare(temp,nama3[j-1])<0;j--)
nama3[j] = nama3[j-1];
nama3[j]=temp;
}
}
public static void tampilB(int n,String nama[])
{ System.out.println("\nVia Bubble\n");
for (int i=0;i
System.out.println("No."+(i+1)+" "+nama[i]);
}
public static void tampilS(int n,String nama2[])
{ System.out.println("\nVia Selection\n");
for (int i=0;i
System.out.println("No."+(i+1)+" "+nama2[i]);
}
public static void tampilI(int n,String nama3[])
{ System.out.println("\nVia Insertion\n");
for (int i=0;i
System.out.println("No."+(i+1)+" "+nama3[i]);
}
}

contoh lain....

//@Author Arshie

import javax.swing.JOptionPane;
public class sorting1 {

  public static void main(String[] args){
    int[] data = new int[5];
    int index;

    System.out.print("Datanya : ");
    for(index=0; index
    data[index] = Integer.parseInt(JOptionPane.showInputDialog("data ke-" + (index+1)));
    System.out.print(data[index]+", ");
    }


    {
    System.out.println("\n\nData sebelum di sort : ");
    for(int i = 0; i < data.length; i++)
    System.out.print( data[i]+"  ");

    }

    insertion_sort(data, data.length);
    System.out.print("\n\nData setelah di sort:\n");
for(int i = 0; i
System.out.print(data[i]+"  ");
System.out.println();

    }

  
    public static void insertion_sort(int data[], int n){
for (int i = 1; i
int j = i;
int B = data[i];
while ((j > 0) && (data[j-1] > B)){
data[j] = data[j-1];
j--;
}
data[j] = B;
}
         
           
         }
}


Read More ->>

Selasa, 19 April 2011

SENI HACKER

Yang pertama untuk perkenalan, kita kenali dahulu apa itu Hacker dan Craker
Read More ->>

Popular Posts