title: Recursive function to reverse an array implementation of a queue in Java
body: <pre><code>import java.util.Scanner;
  
  class ed {
      int fr, r;
      int q[];
      int n;
  
      ed(int x) {
          n = x;
          fr = -1;
          r = -1;
          q = new int[n];
      }
  
      void enque(int n) {
          int val = n;
          while (r &lt; n-1) {
              if (r==n-1) {
                  System.out.println(&quot;Overflow&quot;);
                  break;
              }
              else if (fr==-1 &amp;&amp; r==-1) {
                  fr=0;
                  r=0;
                  q[r] = val;
              }
              else {
                  r += 1;
                  q[r] = val;
              }
          }
      }
      void deque() {
          if (fr==-1 &amp;&amp; r==-1) {
              System.out.println(&quot;Underflow&quot;);
          }
          else if (fr==r) {
              fr=-1;
              r=-1;
          }
          else {
              fr += 1;
          }
      }
      void reverse(int[] q) {
          int a = q[0];
          deque();
          reverse(q);
          enque(a);
      }
      void printq() {
          for (int i = fr; i&lt;=r; i++) {
              System.out.print(q[i] + &quot; &quot;);
          }
      }
  }
  
  public class q1 {
  
      static Scanner f = new Scanner (System.in);
      public static void main(String[] args) {
          
          int n = f.nextInt();
          ed que = new ed(n);
          for (int i=0; i&lt;n; i++) {
              int x = f.nextInt();
              que.enque(x);
          }
          // que.deque();
  
          // que.printq();
          que.reverse(que.q);
  
      }
  }
  
  </code></pre>
  <p>My aim is to reverse a queue (Array) using a recursive function, but in VS Code, the loop is running infinite times and I'm not getting a chance to see the error. I'd like to know my mistake, and any improvement is highly appreciated.
  The class ed contains a constructor which initializes the array and the front, rear values. Enque method adds an element to the queue at the rear, deque method removes the front element. Reverse method takes an array input (queue), stores the foremost element in the variable a, deques it, calls itself, then enques it at the back. VS Code is showing the error at line 48 (reverse(q), when it calls itself) but it's not showing the error as it's so far up.</p>