From a3536b9ebe68b4b7ab78ac9960e5c2a50d84acc7 Mon Sep 17 00:00:00 2001
From: GauravWalia19 <gauravwalia019@gmail.com>
Date: Thu, 18 Apr 2019 13:16:45 +0530
Subject: [PATCH] added array rotation 3 approaches

---
 .../ARRAYS/MISC/ArrayRotation1.java           |  42 +++++++
 .../ARRAYS/MISC/ArrayRotation2.java           |  35 ++++++
 .../ARRAYS/MISC/jugglingAlgo.java             |  44 +++++++
 Java/README.md                                |   4 +
 datastructures.md                             | 114 +++++++-----------
 5 files changed, 171 insertions(+), 68 deletions(-)
 create mode 100644 Java/Data-Structures/ARRAYS/MISC/ArrayRotation1.java
 create mode 100644 Java/Data-Structures/ARRAYS/MISC/ArrayRotation2.java
 create mode 100644 Java/Data-Structures/ARRAYS/MISC/jugglingAlgo.java

diff --git a/Java/Data-Structures/ARRAYS/MISC/ArrayRotation1.java b/Java/Data-Structures/ARRAYS/MISC/ArrayRotation1.java
new file mode 100644
index 0000000..1782132
--- /dev/null
+++ b/Java/Data-Structures/ARRAYS/MISC/ArrayRotation1.java
@@ -0,0 +1,42 @@
+/*
+ *  ARRAY ROTATION USING TEMP ARRAY
+ *  LEFT ROTATE TO 2
+ */
+import java.util.*;
+public class ArrayRotation1
+{
+    public static void main(String[] args)
+    {
+        Scanner in = new Scanner(System.in);
+        int[] arr = {1,2,3,4,5,6,7};
+        int shift=2;
+
+        rotate(arr,shift,arr.length);
+        
+        in.close();
+    }
+    public static void rotate(int[] arr,int d,int n)
+    {
+        int[] temp = new int[d];
+        //copy arr 2 elements to temp
+        for(int i=0;i<temp.length;i++)
+        {
+            temp[i] = arr[i];
+        }
+        //shifting array
+        for(int i=0;i<arr.length-d;i++)
+        {
+            arr[i]=arr[i+d];
+        }
+        //copy temp array to array
+        for(int i=0;i<d;i++)
+        {
+            arr[i+arr.length-d] =temp[i];
+        }
+        for(int i=0;i<arr.length;i++)
+        {
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }   
+}
\ No newline at end of file
diff --git a/Java/Data-Structures/ARRAYS/MISC/ArrayRotation2.java b/Java/Data-Structures/ARRAYS/MISC/ArrayRotation2.java
new file mode 100644
index 0000000..2c9d0e1
--- /dev/null
+++ b/Java/Data-Structures/ARRAYS/MISC/ArrayRotation2.java
@@ -0,0 +1,35 @@
+/*
+ *  ARRAY ROTATION USING ONE ELEMENT
+ *  LEFT ROTATE BY 2
+ */
+import java.util.*;
+public class ArrayRotation2
+{
+    public static void main(String[] args)
+    {
+        Scanner in = new Scanner(System.in);
+        int[] arr={1,2,3,4,5,6,7};  
+        int shift=3;     
+        rotate(arr, shift, arr.length);
+
+        //printing array
+        for(int i=0;i<arr.length;i++)
+        {
+            System.out.print(arr[i]+" ");
+        }
+        in.close();
+    }
+    public static void rotate(int[] arr,int d,int n)
+    {
+        //we can shift one by one    
+        for(int i=0;i<d;i++)
+        {
+            int temp = arr[0];
+            for(int j=0;j<n-1;j++)
+            {
+                arr[j]=arr[j+1];
+            }
+            arr[n-1]=temp;
+        }
+    }
+}
\ No newline at end of file
diff --git a/Java/Data-Structures/ARRAYS/MISC/jugglingAlgo.java b/Java/Data-Structures/ARRAYS/MISC/jugglingAlgo.java
new file mode 100644
index 0000000..fecebf2
--- /dev/null
+++ b/Java/Data-Structures/ARRAYS/MISC/jugglingAlgo.java
@@ -0,0 +1,44 @@
+abstract class jugglingAlgo
+{
+    public static void main(String[] args)
+    {
+        int[] arr = {1,2,3,4,5,6,7,8,9};
+        leftRotation(arr,3);
+        for(int i=0;i<arr.length;i++)
+        {
+            System.out.print(arr[i] + " ");
+        }        
+        System.out.println();
+    }
+    public static int[] leftRotation(int[] arr,int k)
+    {
+        int set = gcd(arr.length, k);
+
+        for(int i=0;i<set;i++)
+        {
+            int temp = arr[i];
+            int j=i;
+            while(true)
+            {
+                int d = (j+k) % arr.length;
+                
+                if(d==i)
+                {
+                    break;
+                }
+                arr[j] = arr[d];
+                j=d;
+            }
+            arr[j] = temp;
+        }
+        return arr;
+    }
+    public static int gcd(int a,int b)
+    {
+        if(b==0)
+        {
+            return a;
+        }
+        return gcd(b,a%b);
+    }
+}
\ No newline at end of file
diff --git a/Java/README.md b/Java/README.md
index 31b849e..bf78e3e 100644
--- a/Java/README.md
+++ b/Java/README.md
@@ -17,6 +17,10 @@
 * MISC
   * JAGGED ARRAY
   * [SPIRAL ORDER MATRIX](Data-Structures/ARRAYS/MISC/spiralOrder.java)
+  * Rotate 1D array to left by K
+    * APPROACH 1: [rotate array using temp array](Data-Structures/ARRAYS/MISC/ArrayRotation1.java)
+    * APPROACH 2: [rotate array by rotating one element](Data-Structures/ARRAYS/MISC/ArrayRotation2.java)
+    * APPROACH 3: [rotate array using Juggling Algorithm](Data-Structures/ARRAYS/MISC/jugglingAlgo.java)
 
 #### STRING
 
diff --git a/datastructures.md b/datastructures.md
index f967489..f89d6f0 100644
--- a/datastructures.md
+++ b/datastructures.md
@@ -6,8 +6,7 @@ Indexer for Data Structures Lover
 
 ### 1 DIMENSIONAL
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/ARRAYS/1darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/1darrays.cpp)
@@ -20,8 +19,7 @@ Indexer for Data Structures Lover
 
 ### 2 DIMENSIONAL
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/ARRAYS/2darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/2darrays.cpp)
@@ -34,8 +32,7 @@ Indexer for Data Structures Lover
 
 ### 3 DIMENSIONAL
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/ARRAYS/3darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/3darrays.cpp)
@@ -48,8 +45,7 @@ Indexer for Data Structures Lover
 
 ### 4 DIMENSIONAL
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/ARRAYS/4darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/4darrays.cpp)
@@ -60,16 +56,14 @@ Indexer for Data Structures Lover
 
 #### ARRAYS CLASS(JAVA)
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/ARRAYS/INBUILT/arrays.java)
 * complexity
 
 #### ARRAY CLASS(C++)
 
-* blog
-* docs
+* blog/docs
 * array class in c++
 * complexity
 
@@ -77,8 +71,7 @@ Indexer for Data Structures Lover
 
 #### JAGGED
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/ARRAYS/MISC/jaggedarray.c)
 * complexity
@@ -90,10 +83,21 @@ Indexer for Data Structures Lover
   * [JAVA](Java/Data-Structures/ARRAYS/MISC/spiralOrder.java)
 * complexity
 
+#### Rotate 1 D Array to left by K
+
+* blog/docs
+* implementation
+  * APPROACH 1: Rotate array using temp array
+    * [JAVA](Java/Data-Structures/ARRAYS/MISC/ArrayRotation1.java)
+  * APPROACH 2: Rotate array using single element
+    * [JAVA](Java/Data-Structures/ARRAYS/MISC/ArrayRotation2.java)
+  * APPROACH 3: Rotate array using Juggling Algorithm
+    * [JAVA](Java/Data-Structures/ARRAYS/MISC/jugglingAlgo.java)
+* complexity
+
 ## :octocat: STRING
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/STRING/String.c)
   * [C++](C++/Data-Structures/STRING/Strings.cpp)
@@ -104,8 +108,7 @@ Indexer for Data Structures Lover
 
 ### SINGLE
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/LINKED-LIST/SINGLE/Main.c)
   * [C++](C++/Data-Structures/LISTS/LINKED-LIST/SINGLE/Main.cpp)
@@ -116,8 +119,7 @@ Indexer for Data Structures Lover
 
 ### DOUBLE
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/LINKED-LIST/DOUBLE/Main.c)
   * JAVA
@@ -127,8 +129,7 @@ Indexer for Data Structures Lover
 
 ### CIRCULAR
 
-* blog
-* docs
+* blog/docs
 * implementation
   * JAVA
     * [STANDARD](Java/Data-Structures/LISTS/CIRCULAR/STANDARD/CircularLinkedList.java)
@@ -139,16 +140,14 @@ Indexer for Data Structures Lover
 
 #### ARRAYLIST
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/LISTS/INBUILT/arrayList.java)
 * complexity
 
 #### VECTOR
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C++](C++/Data-Structures/LISTS/VECTORS/Main.cpp)
   * [JAVA](Java/Data-Structures/LISTS/INBUILT/vectors.java)
@@ -158,8 +157,7 @@ Indexer for Data Structures Lover
 
 #### LIST PY
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [PYTHON](Python3/Data-Structures/LISTS/inbuiltList.py)
 * complexity
@@ -168,8 +166,7 @@ Indexer for Data Structures Lover
 
 #### Find the nth node from end in single linked list
 
-* blog
-* docs
+* blog/docs
 * implementation
   * APPROACH 1: Compute the size while adding
     * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach1.java)
@@ -194,8 +191,7 @@ Indexer for Data Structures Lover
 
 ### FIXED ARRAY STACK
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C++](C++/Data-Structures/STACKS/Stack.hpp)
   * [JAVA](Java/Data-Structures/STACKS/FIXED-ARRAY-STACK/ArrayStack.java)
@@ -203,24 +199,21 @@ Indexer for Data Structures Lover
 
 ### DYNAMIC ARRAY STACK
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/STACKS/DYNAMIC-ARRAY-STACK/DynamicArrayStack.java)
 * complexity
 
 ### LINKED STACK
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/STACKS/LINKED-STACK/LinkedStack.java)
 * complexity
 
 ### INBUILT STACKS
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C++](C++/Data-Structures/STACKS/stack.cpp)
   * [JAVA](Java/Data-Structures/STACKS/INBUILT-STACK/Stacks.java)
@@ -230,40 +223,35 @@ Indexer for Data Structures Lover
 
 #### Minimum bracket reversal for making brackets balanced
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/STACKS/MISC-STACKS/minimum_bracket_reversal_for_balanced_expression.c)
 * complexity
 
 #### Given expression has balanced brackets or not
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/STACKS/MISC-STACKS/BracketsBalancedOrNot.java)
 * complexity
 
 #### Infix Evaluation
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/STACKS/MISC-STACKS/InfixEvaluation.java)
 * complexity
 
 #### Postfix Evaluation
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C](C/Data-Structures/STACKS/MISC-STACKS/postfix_evaluation.c)
 * complexity
 
 #### TWO WAY STACK
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [C++](C++/Data-Structures/STACKS/Tstack.hpp)
 * complexity
@@ -274,23 +262,20 @@ Indexer for Data Structures Lover
 
 #### FIXED ARRAY SIMPLE QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/QUEUES/SIMPLE-QUEUE/FixedArraySimpleQueue.java)
 * complexity
 
 #### DYNAMIC ARRAY SIMPLE QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
 #### LINKED SIMPLE QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
@@ -298,22 +283,19 @@ Indexer for Data Structures Lover
 
 #### FIXED ARRAY CIRCULAR QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
 #### DYNAMIC ARRAY CIRCULAR QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
 #### LINKED CIRCULAR QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
@@ -321,23 +303,20 @@ Indexer for Data Structures Lover
 
 #### FIXED ARRAY PRIORITY QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [JAVA](Java/Data-Structures/QUEUES/PRIORITY-QUEUE/ArrayPriorQueue.java)
 * [complexity](docs/complexity.md#fixed-array-priority-queue)
 
 #### LINKED PRIORITY QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
 #### HEAPED PRIORITY QUEUE
 
-* blog
-* docs
+* blog/docs
 * implementation
 * complexity
 
@@ -380,8 +359,7 @@ Indexer for Data Structures Lover
 
 ##### BOTTOM VIEW OF A TREE
 
-* blog
-* docs
+* blog/docs
 * implementation
   * [ITERATIVE](Java/Data-Structures/TREES/BINARY-TREE/MISC/BottomView.java)
 * [complexity](docs/complexity.md#binary-trees)