Merge pull request #462 from Akshit312/master

Create Sort Nearly sorted array

Author: probot-auto-merge[bot]

Gcd.java

@@ -0,0 +1,17 @@
+class Test {
+
+    static int gcd(int a, int b) 
+    { 
+      if (b == 0) 
+        return a; 
+      return gcd(b, a % b);  
+    } 
+      
+    // Driver method 
+    public static void main(String[] args)  
+    { 
+    Scanner sc=new Scanner(System.in);
+       int a=sc.nextInt(),b=sc.nextInt(); 
+        System.out.println("GCD of " + a +" and " + b + " is " + gcd(a, b)); 
+    } 
+} 

Sorting Algorithm/Sort Nearly sorted array

@@ -0,0 +1,15 @@
+static void insertionSort(int A[], int size)  
+{  
+int i=0, k=0, j=0;  
+for (i = 1; i < size; i++)  
+{  
+    k = A[i];  
+    j = i-1;  
+    while (j >= 0 && A[j] > k)  
+    {  
+        A[j+1] = A[j];  
+        j = j-1;  
+    }  
+    A[j+1] = k;  
+}  
+}