CombSort.java

import java.util.Random;

public class CombSort {

    public static void main(String[] args) {
        int[] array = new int[10];
        int n = array.length;
        Random random = new Random();
        System.out.print("The output array is:\n[");
        /* Making of the array */
        for (int i = 0; i < n; i++) {
            array[i] = random.nextInt(20) + 1;
            if (i == n - 1) {
                System.out.println(array[i] + "]\n\n== SORTING THE ARRAY ==\n");
            } else
                System.out.print(array[i] + "  ");
        }

        /* The actual algorithm: */
        int temp;
        final float k = 1.2473309f;
        for (int step = n - 1; step >= 1; step /= k) {
            for (int i=0; i < n - step; i++) {
                if (array[i] > array[i+step]) {
                    temp = array[i];
                    array[i] = array[i+step];
                    array[i+step] = temp;
                }
            }
        }

        /* Array output */
        System.out.print("The sorted array is:\n[");
        for (int i = 0; i < n; i++) {
            if (i == n - 1) {
                System.out.print(array[i] + "]");
            } else {
                System.out.print(array[i] + "  ");
            }
        }
    }
}