Fix NoClassDefFoundError exception (TheAlgorithms#2838)

FyZhu97 · siriak · web-flow · commit 6c00beec9002 · 2021-11-23T08:55:24.000+02:00
Co-authored-by: Andrii Siriak &lt;siryaka@gmail.com&gt;
diff --git a/src/main/java/com/thealgorithms/datastructures/queues/CircularQueue.java b/src/main/java/com/thealgorithms/datastructures/queues/CircularQueue.java
@@ -4,41 +4,12 @@
 //Link to the concept: (https://en.wikipedia.org/wiki/Circular_buffer)
 public class CircularQueue {
 
-    public static void main(String[] args) {
-        circularQueue cq = new circularQueue(5);
-        System.out.println(cq.isEmpty());
-        System.out.println(cq.isFull());
-        cq.enQueue(1);
-        cq.enQueue(2);
-        cq.enQueue(3);
-        cq.enQueue(4);
-        cq.enQueue(5);
-
-        System.out.println(cq.deQueue());
-        System.out.println(cq.deQueue());
-        System.out.println(cq.deQueue());
-        System.out.println(cq.deQueue());
-        System.out.println(cq.deQueue());
-        System.out.println(cq.isFull());
-        System.out.println(cq.isEmpty());
-        cq.enQueue(6);
-        cq.enQueue(7);
-        cq.enQueue(8);
-        System.out.println(cq.peek());
-        System.out.println(cq.peek());
-        cq.deleteQueue();
-
-    }
-}
-
-class circularQueue {
-
     int[] arr;
     int topOfQueue;
     int beginningOfQueue;
     int size;
 
-    public circularQueue(int size) {
+    public CircularQueue(int size) {
         arr = new int[size];
         topOfQueue = -1;
         beginningOfQueue = -1;
@@ -115,4 +86,30 @@ public void deleteQueue() {
         System.out.println("The Queue is deleted!");
     }
 
+
+    public static void main(String[] args) {
+        CircularQueue cq = new CircularQueue(5);
+        System.out.println(cq.isEmpty());
+        System.out.println(cq.isFull());
+        cq.enQueue(1);
+        cq.enQueue(2);
+        cq.enQueue(3);
+        cq.enQueue(4);
+        cq.enQueue(5);
+
+        System.out.println(cq.deQueue());
+        System.out.println(cq.deQueue());
+        System.out.println(cq.deQueue());
+        System.out.println(cq.deQueue());
+        System.out.println(cq.deQueue());
+        System.out.println(cq.isFull());
+        System.out.println(cq.isEmpty());
+        cq.enQueue(6);
+        cq.enQueue(7);
+        cq.enQueue(8);
+        System.out.println(cq.peek());
+        System.out.println(cq.peek());
+        cq.deleteQueue();
+
+    }
 }
