F -X C h a n ge

F -X C h a n ge

W
N
O
y
bu

Contoh 1.1 SOURCE CODE JAVA { BUBBLE SORT }

import java.util.Scanner;
public class BubbleSort_Cek_dari_kanan {
public static void main(String[] args)
{
Scanner scanKata= new Scanner(System.in);
Scanner scanAngka= new Scanner(System.in);
System.out.print ("Masukkan Jumlah Angka :");
int input= scanAngka.nextInt();
String [] tInput = new String [input];
int mtdSort= 0;
System.out.println ("\nCatatan :\n" + "Inputan Boleh Berupa Angka
Atau Kata\n");
for (int i = 0; i < input; i++){
System.out.print ("Masukkan inputan ke-"+(i+1)+" : ");
tInput[i]= scanKata.nextLine();
}
do { System.out.print ("\nPilih Metode Sorting :\n"
+ "1. Ascending\n"
+ "2. Descending\n\n"
+ "Masukkan Pilihan Anda :");

try {
String mtd= scanKata.next();
mtdSort= Integer.parseInt(mtd);
}
catch (Exception e){
mtdSort= 3;
}
System.out.println("");
switch (mtdSort) {
case 1:
int count= 1;
System.out.println ("# Data Awal :");
for (int i = 0; i < input; i++){
if (i == input-1){
System.out.println(tInput[i]+"\n");
}

ac

.c

tr

om

k
lic
C

om

k
lic
C

.c

re

k e r- s o ft w a

ac

ww

ww

tr

to

to

bu

N
O

PD

PD

k e r- s o ft w a

re

F -X C h a n ge

F -X C h a n ge

W
y
bu

System.out.print(tInput[i]+" ");
}
}
for (int x = 0; x 0; y--) {
if (tInput[y].compareToIgnoreCase(tInput[y-1])<0) {
String temp = tInput[y];
tInput[y] = tInput[y-1];
tInput[y-1] = temp;
}
}
if (count < input-1) {
System.out.println ("# Proses ke-"+count+" :");
}
else if (count == input-1) {
System.out.println("# Hasil Sorting :");
}
for (int i = 0; i < input; i++) {
if (i == input-1) {
System.out.println (tInput[i]+"\n");
}
else {
System.out.print(tInput[i]+" ");
}
}
count++;
}
break;
case 2:
count= 1;
System.out.println ("# Data Awal :");
for (int i = 0; i < input; i++){
if (i == input-1){
System.out.println(tInput[i]+"\n");
}
else {
System.out.print(tInput[i]+" ");
}
}
for (int x = 0; x 0; y--) {

ac

.c

tr

om

to
k
lic
C

k
lic
C

.c

re

k e r- s o ft w a

ac

om

to

bu

else {
ww

ww

tr

N
O

N
O

PD

PD

k e r- s o ft w a

re

F -X C h a n ge

F -X C h a n ge

W
y
bu

String temp = tInput[y];

tInput[y] = tInput[y-1];
tInput[y-1] = temp;
}
}
if (count < input-1) {
System.out.println("# Proses ke-"+count+" :");
}
else if (count == input-1) {
System.out.println("# Hasil Sorting :");
}
for (int i = 0; i < input; i++){
if (i == input-1){
System.out.println(tInput[i]+"\n");
}
else {
System.out.print(tInput[i]+" ");
}
}
count++;
}
break;
default;
System.out.println("\nMasukkan Angka 1 - 2 !!!");
break;
}
} while (mtdSort == 3);
}
}

ac

.c

tr

om

to
k
lic
C

k
lic
C

.c

re

k e r- s o ft w a

ac

om

to

bu

if (tInput[y].compareToIgnoreCase(tInput[y-1])>0) {
ww

ww

tr

N
O

N
O

PD

PD

k e r- s o ft w a

re