Minggu, 27 Mei 2012
LinkedList input user 10 angka
Node.java
public class Node {
int angka;
Node next;
Node(int data){
this.angka = data;
}
}
NodeListApp.java
public class NodeListApp {
public static void main(String[]args){
Minggu, 20 Mei 2012
Pencarian / Searching
public class SearchingApp {
public static void main(String[] args){
int aa = Integer.parseInt(JOptionPane.showInputDialog("Masukkan Jumlah Data!"));
Searching data = new Searching(aa);
for(int i=0;i<aa;i++){
String bb = JOptionPane.showInputDialog("Masukkan Kata ke-"+(i+1));
data.isi(bb);
}
data.tampil();
String cari = JOptionPane.showInputDialog("Masukkan kata yang dicari!");
int f = data.SeqSearch(cari);
if(f<0){
JOptionPane.showMessageDialog(null,"Maaf, Data tidak ditemukan");
}else{
JOptionPane.showMessageDialog(null,"Data ditemukan pada array ke-"+f);
Pengurutan / Sorting
public class Sorting {
private int[] a;
private int nElems;
public Sorting(int max)
{
a = new int[max];
nElems = 0;
}
public void isi(int value)
{
a[nElems] = value;
nElems++;
}
public void tampil()
{
for(int j=0; j<nElems; j++){
Minggu, 06 Mei 2012
Hirarki Class Hewan
HewanApp.java
public class HewanApp {
public static void main(String[] args) {
//bikin objek dulu
//Superclass//
Hewan superH = new Hewan();
//sub hewan//
HewanMamalia subMa = new HewanMamalia();
HewanUnggas subUng = new HewanUnggas();
HewanReptil subRep = new HewanReptil();
Array satu dimensi dan dua dimensi
public class Array1Dimensi {
public static void main(String[] args){
int bab[] = new int[10];
for(int i=0;i<10;i++){
bab[i]=i+1;
}
for(int i=0;i<10;i++){
System.out.println("array ke-"+i+" = "+bab[i]);
}
Selasa, 10 April 2012
Array Mahasiswa
public class ArrayMahasiswa {
public static void main(String[] args){
int loop=Integer.parseInt(JOptionPane.showInputDialog("Berapa Jumlah data ?"));
String[] npm = new String[loop];
String[] nama = new String[loop];
String[] alamat = new String[loop];
for(int i=0;i<loop;i++){
public static void main(String[] args){
int loop=Integer.parseInt(JOptionPane.showInputDialog("Berapa Jumlah data ?"));
String[] npm = new String[loop];
String[] nama = new String[loop];
String[] alamat = new String[loop];
for(int i=0;i<loop;i++){
Minggu, 08 April 2012
Fungsi Rekursif
Faktorial.java
public class soal_1 {
public int faktorial( int n )
{
if( n <= 0 )
return 1;
else
return n * faktorial( n - 1 );
}
}
public class soal_1 {
public int faktorial( int n )
{
if( n <= 0 )
return 1;
else
return n * faktorial( n - 1 );
}
}
Langganan:
Postingan (Atom)