/* * Queue Data Structure * * - this queue stores integers only, you may modify it to objects, * string, and etc.. (kaw bahala...) * * --> Q & A to * http://www.planet-java.biz.ly * Arthur Y. Gapusan */ class SuperQueue { int num[]; int readyOut[]; int size; SuperQueue(int s) { num = new int[s]; readyOut = new int[s]; size = -1; } void enQueue(int item) { if (size==num.length-1) System.out.println("Queue is full"); else num[++size] = item; } int deQueue() { if (size<0) System.out.println("Queue is empty"); else { for(int i=size, j=0;i>=0;i--, j++) readyOut[j] = num[i]; for(int i=size-1, j=0;i>=0;i--, j++) num[j] = readyOut[i]; return readyOut[size--]; } return 0; } } /* --> below is just a sample representation of how the this queue class works... */ class TestQueue { public static void main(String args[]) { SuperQueue sq = new SuperQueue(10); // the size of the queue. (size don't shrink or grow) sq.enQueue(10); sq.enQueue(12); sq.enQueue(5); sq.enQueue(60); System.out.println("Size of Queue: " + (sq.size+1)); for (int i=0;i " + sq.deQueue()); System.out.println("deQueued --> " + sq.deQueue()); System.out.println(); System.out.println(" |-- Queue --| "); System.out.println(); for (int i=0;i 6"); System.out.println("enQueued --> 122"); System.out.println("enQueued --> 65"); System.out.println("enQueued --> 23"); System.out.println("enQueued --> 34"); System.out.println("enQueued --> 15"); sq.enQueue(6); sq.enQueue(122); sq.enQueue(65); sq.enQueue(23); sq.enQueue(34); sq.enQueue(15); System.out.println(); System.out.println(" |-- Queue --| "); System.out.println(); for (int i=0;i " + sq.deQueue()); System.out.println("deQueued --> " + sq.deQueue()); System.out.println("deQueued --> " + sq.deQueue()); System.out.println("deQueued --> " + sq.deQueue()); System.out.println("deQueued --> " + sq.deQueue()); System.out.println("deQueued --> " + sq.deQueue()); System.out.println(); System.out.println(" |-- Queue --| "); System.out.println(); for (int i=0;i