From 6863e3630bc2a28d7c4104a875a40804081ff05d Mon Sep 17 00:00:00 2001
From: Tushar <tushartuteja.india@gmail.com>
Date: Wed, 23 Oct 2019 01:49:42 +0530
Subject: [PATCH] My commit for Codes'

---
 StaticQueueinjava.class | Bin 0 -> 755 bytes
 StaticQueueinjava.java  | 121 ++++++++++++++++++++++++++++++++++++++++
 TowerOfHanoi.class      | Bin 0 -> 1111 bytes
 TowerOfHanoi.java       |  20 +++++++
 4 files changed, 141 insertions(+)
 create mode 100644 StaticQueueinjava.class
 create mode 100644 StaticQueueinjava.java
 create mode 100644 TowerOfHanoi.class
 create mode 100644 TowerOfHanoi.java

diff --git a/StaticQueueinjava.class b/StaticQueueinjava.class
new file mode 100644
index 0000000000000000000000000000000000000000..93fb7492781bc934d3d6f9fa40e48bbd5adb086f
GIT binary patch
literal 755
zcmZ`$+invv5IxRq8?&U>gi9}^EtgFKjl=^yB&v{TD<MTt2oO~TBqwnrM_F&0dMW)V
z9^ipSAou`23NhYom7)qioS8YA@f;uj{`378fXCS2$Rh8cz>&Z;3)d~&uy8YrMJ!EW
z*})3OEfg)e>R^o_Q&(D<O@^dbddrY{8gwPYbVF(RJoMXg^jfqB#H4(oG(*ALZ}i1S
zQ5^`~t2WI@>0Zqa@@5c@I&w$Z=0ej5qdG4`8A_#X|Aqw@SCL~#N4zc8UED^_#T}d7
zMb5!J7amFsi=2xCBS%GZ927NaDt6^S8Wm{H8D=IDUbOqNV;q!SRB+$L1G{1N(tdh?
z_sr^a53Q&zbu=7^lk;+0N9=jICC|zWdzvRlM*3t^5E_PjY=R1^yX1f&AEfYW4D*q&
ze`)e~Xqyfg>fUAZF8UcirdImT?L3mTGYYi9DqQ++dlF#QSHfwkmMJod>GCPq7fQ%2
z!c0WIp^;h4QEpp5BT2)+`yWW`Ij2ZADy=b6mDbF{7-<SCaq!~sFbZ))eUgunv16I9
zaOS3xKau?g-a5Nzj4Klfo6*vJlJJ4l3gpqo5;|B%7iIKNMIVpgqlN%aFvK<v@d^el
P9OE56k?466o4~?f1R<wX

literal 0
HcmV?d00001

diff --git a/StaticQueueinjava.java b/StaticQueueinjava.java
new file mode 100644
index 0000000..a517def
--- /dev/null
+++ b/StaticQueueinjava.java
@@ -0,0 +1,121 @@
+class Queue { 
+    private static int front, rear, capacity; 
+    private static int queue[]; 
+  
+    Queue(int c) 
+    { 
+        front = rear = 0; 
+        capacity = c; 
+        queue = new int[capacity]; 
+    } 
+  
+    // function to insert an element 
+    // at the rear of the queue 
+    static void queueEnqueue(int data) 
+    { 
+        // check queue is full or not 
+        if (capacity == rear) { 
+            System.out.printf("\nQueue is full\n"); 
+            return; 
+        } 
+  
+        // insert element at the rear 
+        else { 
+            queue[rear] = data; 
+            rear++; 
+        } 
+        return; 
+    } 
+  
+    // function to delete an element 
+    // from the front of the queue 
+    static void queueDequeue() 
+    { 
+        // if queue is empty 
+        if (front == rear) { 
+            System.out.printf("\nQueue is empty\n"); 
+            return; 
+        } 
+  
+        // shift all the elements from index 2 till rear 
+        // to the right by one 
+        else { 
+            for (int i = 0; i < rear - 1; i++) { 
+                queue[i] = queue[i + 1]; 
+            } 
+  
+            // store 0 at rear indicating there's no element 
+            if (rear < capacity) 
+                queue[rear] = 0; 
+  
+            // decrement rear 
+            rear--; 
+        } 
+        return; 
+    } 
+  
+    // print queue elements 
+    static void queueDisplay() 
+    { 
+        int i; 
+        if (front == rear) { 
+            System.out.printf("\nQueue is Empty\n"); 
+            return; 
+        } 
+  
+        // traverse front to rear and print elements 
+        for (i = front; i < rear; i++) { 
+            System.out.printf(" %d <-- ", queue[i]); 
+        } 
+        return; 
+    } 
+  
+    // print front of queue 
+    static void queueFront() 
+    { 
+        if (front == rear) { 
+            System.out.printf("\nQueue is Empty\n"); 
+            return; 
+        } 
+        System.out.printf("\nFront Element is: %d", queue[front]); 
+        return; 
+    } 
+} 
+  
+public class StaticQueueinjava { 
+  
+    // Driver code 
+    public static void main(String[] args) 
+    { 
+        // Create a queue of capacity 4 
+        Queue q = new Queue(4); 
+  
+        // print Queue elements 
+        q.queueDisplay(); 
+  
+        // inserting elements in the queue 
+        q.queueEnqueue(20); 
+        q.queueEnqueue(30); 
+        q.queueEnqueue(40); 
+        q.queueEnqueue(50); 
+  
+        // print Queue elements 
+        q.queueDisplay(); 
+  
+        // insert element in the queue 
+        q.queueEnqueue(60); 
+  
+        // print Queue elements 
+        q.queueDisplay(); 
+  
+        q.queueDequeue(); 
+        q.queueDequeue(); 
+        System.out.printf("\n\nafter two node deletion\n\n"); 
+  
+        // print Queue elements 
+        q.queueDisplay(); 
+  
+        // print front of the queue 
+        q.queueFront(); 
+    } 
+} 
\ No newline at end of file
diff --git a/TowerOfHanoi.class b/TowerOfHanoi.class
new file mode 100644
index 0000000000000000000000000000000000000000..4a1523e1d319e1067567cbf093eb31cac0960d49
GIT binary patch
literal 1111
zcmaJ<T~8B16g|^!yY0F_0Rbr#ML}Cs>Nmy`6WxT^1jM8SAAE6W2Uxn@X}Vhs|HSy>
zqt9xhh6jIuKgxKvt+u4ZmzkY=?>YC}v-j8U)1Ls=@Yq5MGijK(Wbv3yBa68SrY>8!
zf<+ToO<WU5RCU`A1w>gOx$gRI_*5XCFYF2!j;<+zu}#-kFWZeh)!LDJ9wSCWAM-Nv
zWyf)%%8^PatMx6}{8u1dUtl`_X7flM%c3X!gJLCYx&A>Zs!y#~y<RJ;qT8*i+HfP{
z@g4n6wYK+PNMF0F5!A*7*f!FzY>XjeV#&rbt_x(IYaIq*OE$Muc&KZ^SQ0l<$lEAj
z#l%e;w{Tm)9%Lk{FK2u2NL4xbK&WyOgsQ>ub(@K)u69=!Ur~5S`ARlQ7FJQDRbATz
zW*V}t9PL+S_}UE*`4xoH4+G-!<-+jz0+SsLXK86>Giu_|wW<6ts<3O~PBhvBfu;To
zu79lSs^@H1#D=Vfx^-gW5k+olU2iw(LfQ9K%kg9oC@OnD*rCVKb&<x`JQXZ;fu&&~
z1CcYpos*_Ir+o1LcMUHMdeWnCq~}%KP?b!q2`mrIcb+zZh5y%Kkz1eQzH{B8{o$9v
zZ>|&15x#P~1@FYlcZkoO!cm^dPA~#--+HC{gc{5hv&Ki5*$)`~f|&94D`KCJ%Nn)0
z-24y3|Hc@|&Cf9qk;V{_W=R|MPxHRWGe;fERI<wKI5P>v)7C5#6PWDveA1CiXr`8V
zmU*6WIvor)Ib}J%A=%eFia1HeNjia9GNjmKa7-qVh*NGK(j7BK;1rWFOyfRpi_P!i
QA?}f8p6?XjkxvVM0E9>T2LJ#7

literal 0
HcmV?d00001

diff --git a/TowerOfHanoi.java b/TowerOfHanoi.java
new file mode 100644
index 0000000..db2b114
--- /dev/null
+++ b/TowerOfHanoi.java
@@ -0,0 +1,20 @@
+public class TowerOfHanoi {
+    static int count=0;
+    static void  move(int disk,char src , char dist, char spare){
+        if(disk==1||disk==0) {
+            //System.out.println("move disk" + disk + " from " + src + " to " + dist);
+            count+=1;
+        }
+        else{
+            move(disk-1,src,spare,dist);
+            //System.out.println("move disk"+disk+" from "+src+" to "+dist);
+            count+=1;
+            move(disk-1,spare,dist,src);
+        }
+    }
+ 
+    public static void main(String[] args) {
+        move(100,'A','B','C');
+        System.out.println("count"+count);
+    }
+}
\ No newline at end of file