public class Queue { // Variabel Internal private int head = 0; private int tail = 0; private int[] isi = new int[4]; // Kontruktor public Queue() {} public int GetIsiByIndex(int index) { return isi[index]; } // Enqueue public void Enqueue(int x) { if(tail < 4) { isi[tail] = x; tail++; } else { System.out.println("Penuh"); } } // Dequeue public int Dequeue() { if(tail != head) { int temp = isi[head]; for(int a = head; a < tail; a++) { if(a == tail-1) { isi[a] = 0; } else { isi[a] = isi[a+1]; } } tail--; return temp; } else { System.out.println("Kosong"); return 0; } } // Print public void Print() { String teks = ""; for(int a=0; a<4; a++) { teks += isi[a]+","; } System.out.println(teks); } public static void main(String[] args) { // Buat queue Queue q1 = new Queue(); // Enqueue q1.Enqueue(31); q1.Enqueue(32); q1.Enqueue(33); q1.Enqueue(34); q1.Enqueue(35); q1.Enqueue(36); q1.Print(); System.out.println(q1.Dequeue()); q1.Print(); System.out.println(q1.Dequeue()); q1.Print(); System.out.println(q1.Dequeue()); q1.Print(); System.out.println(q1.Dequeue()); q1.Print(); System.out.println(q1.Dequeue()); q1.Print(); } }
contoh program queue dengan java
January 18, 2014
Bobby Syahronanda
You May Also Like
Perkalian Matriks Secara Dinamis Pada Java
June 06, 2014
membuat program polindrom linkedlist dengan java
January 18, 2014
membuat faktorial dengan perulangan while pada java
January 18, 2014
ijin nyimak aja salam kenal
ReplyDeletesama sama gan.. semoga bermanfaat :)
Delete:( izin share pic langkah kerja lansung dr SS pic HP ny om :D
ReplyDelete