Implemented Comb Sort in Java

Author: adithyaakrishna

Diff for: sortingAlgo/combSort/combSort.java

@@ -0,0 +1,66 @@
+// Java program for implementation of Comb Sort 
+class CombSort 
+{ 
+    // To find gap between elements 
+    int getNextGap(int gap) 
+    { 
+        // Shrink gap by Shrink factor 
+        gap = (gap*10)/13; 
+        if (gap < 1) 
+            return 1; 
+        return gap; 
+    } 
+  
+    // Function to sort arr[] using Comb Sort 
+    void sort(int arr[]) 
+    { 
+        int n = arr.length; 
+  
+        // initialize gap 
+        int gap = n; 
+  
+        // Initialize swapped as true to make sure that 
+        // loop runs 
+        boolean swapped = true; 
+  
+        // Keep running while gap is more than 1 and last 
+        // iteration caused a swap 
+        while (gap != 1 || swapped == true) 
+        { 
+            // Find next gap 
+            gap = getNextGap(gap); 
+  
+            // Initialize swapped as false so that we can 
+            // check if swap happened or not 
+            swapped = false; 
+  
+            // Compare all elements with current gap 
+            for (int i=0; i<n-gap; i++) 
+            { 
+                if (arr[i] > arr[i+gap]) 
+                { 
+                    // Swap arr[i] and arr[i+gap] 
+                    int temp = arr[i]; 
+                    arr[i] = arr[i+gap]; 
+                    arr[i+gap] = temp; 
+  
+                    // Set swapped 
+                    swapped = true; 
+                } 
+            } 
+        } 
+    } 
+  
+    // Driver method 
+    public static void main(String args[]) 
+    { 
+        CombSort ob = new CombSort(); 
+        int arr[] = {8, 4, 1, 56, 3, -44, 23, -6, 28, 0}; 
+        ob.sort(arr); 
+  
+        System.out.println("sorted array"); 
+        for (int i=0; i<arr.length; ++i) 
+            System.out.print(arr[i] + " "); 
+  
+    } 
+}