docs: update the whole repository

* fix some bugs
* delete duplicate files
* format code

Others/ReverseStackUsingRecursion.java

@@ -1,3 +1,5 @@
+package Others;
+
 /* Program to reverse a Stack using Recursion*/
 
 
@@ -6,20 +8,18 @@ import java.util.Stack;
 public class ReverseStackUsingRecursion {
 
     //Stack
-    private static Stack<Integer> stack=new Stack<>();
+    private static Stack<Integer> stack = new Stack<>();
 
     //Main function
     public static void main(String[] args) {
         //To Create a Dummy Stack containing integers from 0-9
-        for(int i=0;i<10;i++)
-        {
+        for (int i = 0; i < 10; i++) {
             stack.push(i);
         }
         System.out.println("STACK");
 
         //To print that dummy Stack
-        for(int k=9;k>=0;k--)
-        {
+        for (int k = 9; k >= 0; k--) {
             System.out.println(k);
         }
 
@@ -28,8 +28,7 @@ public class ReverseStackUsingRecursion {
 
         System.out.println("REVERSED STACK : ");
         //To print reversed  stack
-        while (!stack.isEmpty())
-        {
+        while (!stack.isEmpty()) {
             System.out.println(stack.pop());
         }
 
@@ -38,13 +37,13 @@ public class ReverseStackUsingRecursion {
 
     //Function Used to reverse Stack Using Recursion
     private static void reverseUsingRecursion(Stack<Integer> stack) {
-        if(stack.isEmpty()) // If stack is empty then return
+        if (stack.isEmpty()) // If stack is empty then return
         {
             return;
         }
         /* All items are stored in call stack until we reach the end*/
 
-        int temptop=stack.peek();
+        int temptop = stack.peek();
         stack.pop();
         reverseUsingRecursion(stack); //Recursion call
         insertAtEnd(temptop); // Insert items held in call stack one by one into stack
@@ -52,11 +51,9 @@ public class ReverseStackUsingRecursion {
 
     //Function used to insert element at the end of stack
     private static void insertAtEnd(int temptop) {
-        if(stack.isEmpty())
-        {
+        if (stack.isEmpty()) {
             stack.push(temptop); // If stack is empty push the element
-        }
-        else {
+        } else {
             int temp = stack.peek(); /* All the items are stored in call stack until we reach end*/
             stack.pop();