MergeSort dengan Java

import jeliot.io.*;

public class mergeSort{
public static void main(String a[]){
int i;
int array[] = {12,9,4,7,15,1,3,10};
System.out.println("ARIF RAKHMAN HADI");
System.out.println("MOH JA'FAR SHODIQ");
System.out.println("DANAR TRI BASTONI");
System.out.println("ZAENAL");
System.out.println("BENEDICTUS");

System.out.println(" Program Merge Sort");
System.out.println("Nilai Sebelum DiMarge Sort :");
for(i = 0; i < array.length; i++) System.out.print( array[i]+" "); System.out.println(); mergeSort_srt(array,0, array.length-1); System.out.println("Nilai Setelah DiMargeSort :"); for(i = 0; i = high) {
return;
}

int middle = (low + high) / 2;
mergeSort_srt(array, low, middle);
mergeSort_srt(array, middle + 1, high);
int end_low = middle;
int start_high = middle + 1;
while ((lo <= end_low) && (start_high <= high)) { if (array[low] < array[start_high]) { low++; } else { int Temp = array[start_high]; for (int k = start_high- 1; k >= low; k--) {
array[k+1] = array[k];
}
array[low] = Temp;
low++;
end_low++;
start_high++;
}
}
}
}

continue reading

link list hapus belakang tampil dari depan

import jeliot.io.*;

public class IntObj {
public int value;
public IntObj next;
}
public class MyClass {
public static void main() {
IntObj k= new IntObj();
IntObj isi;
IntObj tail;

k.value = 10;

isi = new IntObj();
isi.value = 20;
k.next = isi;
isi = null;

isi = new IntObj();
isi.value = 30;
k.next.next = isi;
isi = null;

isi = new IntObj();
isi.value = 40;
k.next.next.next = isi;
isi = null;

isi = new IntObj();
isi.value = 50;
k.next.next.next.next = isi;
tail=k.next.next.next.next;
isi = null;

System.out.println("isi data asli :");
isi = k;
while(isi != null) {
System.out.println(isi.value);
isi = isi.next;
}
System.out.print("tail = ");
System.out.println(tail.value);

System.out.println("Masukkan jumlah pointer yang akan dihapus: ");

int a= Input.readInt();

if (a==1){
k.next.next.next.next=null;
tail = k.next.next.next;
}
else if (a==2){
k.next.next.next.next=null;
k.next.next.next=null;
tail = k.next.next;
}
else if (a==3){
k.next.next.next.next=null;
k.next.next.next=null;
k.next.next=null;
tail = k.next;
}
else if (a==4){
k.next.next.next.next=null;
k.next.next.next=null;
k.next.next=null;
k.next=null;
tail = k;
}
else if (a==5){
k.next.next.next.next=null;
k.next.next.next=null;
k.next.next=null;
k.next=null;
k=null;
tail = null;
}
else{
System.out.println("input salah");
}

//list Tampil
System.out.println("isi data yang tersisa :");
isi = k;
while(isi != null) {
System.out.println(isi.value);
isi = isi.next;
}
if (tail !=null) {
System.out.print("tail = ");
System.out.println(tail.value);
}
else{
System.out.println("data dan Tailnya kosong");
}
}
}

continue reading

program konversi angka ke nilai di java

import jeliot.io.*;

public class MyClass {
public static void main() {
int a;
a = Input.readInt();
if (a >= 0 & a <= 39) { System.out.print("Nilai anda E"); } else if (a >=40 & a <= 55) { System.out.print("Nilai anda D"); } else if (a >=56 & a <= 65) { System.out.print("Nilai anda C"); } else if (a >=66 & a <= 79) { System.out.print("Nilai anda B"); } else if (a >= 80 & a <= 100)
{
System.out.print("Nilai anda A");
}
else
{
System.out.print("Masukkan anda salah");
}

}
}

continue reading

perkalian matriks ordo 2x2

import jeliot.io.*;

public class MyClass {
public static void main() {
// Your algorithm goes here.
int a [][];
int b [][];
int c [][];
int baris;
int kolom;
a= new int[2][2];

for (baris=0;baris<=1;baris ++){
for (kolom=0;kolom<=1;kolom ++){
System.out.print("input matriks("+ baris +","+ kolom +"):");
a[baris][kolom] = Input.readInt();
}
}

b= new int[2][2];
for (baris=0;baris<=1;baris ++){
for (kolom=0;kolom<=1;kolom ++){
System.out.print("input matriks("+ baris +","+ kolom +"):");
b[baris][kolom] = Input.readInt();
}
}

c= new int[2][2];
c[0][0]=a[0][0]*b[0][0]+a[0][1]*b[1][0] ;
c[0][1]=a[0][1]*b[0][0]+a[1][1]*b[0][1] ;
c[1][0]=a[0][0]*b[1][0]+a[1][0]*b[1][1] ;
c[1][1]=a[0][1]*b[1][0]+a[1][1]*b[1][1] ;
int x;
int z;

for(x=0;x<=1;x++){
for(z=0;z<=1;z++){
System.out.print(c[x][z]+"  ");
}
System.out.println();
}
}
}

continue reading

matriks dalam java (Pengurangan ordo 2x2)

import jeliot.io.*;

public class MyClass {
    public static void main() {
        // Your algorithm goes here.
        int a [][];
        int b [][];
        int c [][];
        int baris;
        int kolom;
        a= new int[2][2];
   
        for (baris=0;baris<=1;baris ++){
            for (kolom=0;kolom<=1;kolom ++){
                System.out.print("input matriks("+ baris +","+ kolom +"):");
                a[baris][kolom] = Input.readInt();
            }
        }

        b= new int[2][2];
        for (baris=0;baris<=1;baris ++){
            for (kolom=0;kolom<=1;kolom ++){
                System.out.print("input matriks("+ baris +","+ kolom +"):");
                b[baris][kolom] = Input.readInt();
            }
        }
       
        c= new int[2][2];
        c[0][0]=a[0][0]-b[0][0];
        c[0][1]=a[0][1]-b[0][1];
        c[1][0]=a[1][0]-b[1][0];
        c[1][1]=a[1][1]-b[1][1];
        int x;
        int z;

        for(x=0;x<=1;x++){
            for(z=0;z<=1;z++){
                System.out.print(c[x][z]+"  ");
            }
            System.out.println();
        }
    }
}

continue reading