希尔排序

import java.util.Random;

import yongbo.tan.algorithm.ArrayUtil;

/**
 * Copyright 2015年5月3日 by
 *
 * All Rights Reserved
 *
 * @Package 
 * @Title: ShellSort.java
 * @author 
 * @date 2015年5月3日 下午6:18:36
 */
public class ShellSort
{

    public static void main(String[] args)
    {
	int k = 0;
	while (k < 1000)
	{
	    ShellSort ss = new ShellSort();
	    Integer[] toBeSortedData = ArrayUtil.createIntergerArrays(
		    new Random(), 11);
	    System.out.println("\n 排序前的数组：");
	    ArrayUtil.printArray(toBeSortedData);
	    Integer[] haveSoredArray = ss.sort(toBeSortedData);
	    System.out.println("\n 排序后的数组：");
	    ArrayUtil.printArray(haveSoredArray);
	    if (ArrayUtil.isSortedArray(haveSoredArray))
	    {
		System.out.println("\n 排序算法正确");
	    }
	    else
	    {
		System.err.println("\n 排序算法错误");
	    }
	    k++;
	}

    }

    private Integer[] sort(Integer[] toBeSortedData)
    {
	int gap = getGap(toBeSortedData.length);
	while (gap > 0)
	{
	    for (int j = 0; j < gap; j++)
	    {
		for (int i = j; i < toBeSortedData.length
			&& (i + gap) < toBeSortedData.length; i += gap)
		{
		    int iV = toBeSortedData[i];
		    int iNextGapV = toBeSortedData[i + gap];
		    if (iV > iNextGapV)
		    {
			int temp = iV;
			toBeSortedData[i] = iNextGapV;
			toBeSortedData[i + gap] = temp;
			int check = i - gap;
			int beforeCheck=i;
			while (check >= 0)
			{
			    int checkV=toBeSortedData[check];
			    int beforeCheckV=toBeSortedData[beforeCheck];
			    if(checkV>beforeCheckV){
				int tempCheck = checkV;
				toBeSortedData[check] = beforeCheckV;
				toBeSortedData[beforeCheck] = tempCheck;
			    }
			    beforeCheck=check;
			    check=check-gap;
			}

		    }

		}

	    }
	    gap = getGap(gap);
	}

	return toBeSortedData;
    }

    private int getGap(int first)
    {
	return (int) Math.floor(first / 2);
    }

}

import java.util.Random;

/**
 * Copyright 2015年5月3日 by 
 *
 * All Rights Reserved
 *
 * @Package 
 * @Title: ArrayUtil.java
 * @author 
 * @date 2015年5月3日 上午9:01:23
 */
public class ArrayUtil
{

    public static boolean isSortedArray(int[] test)
    {
	int i = 0;
	int j = 1;
	while (j < test.length)
	{
	    if (test[i] > test[j])
	    {
		return false;
	    }
	    i++;
	    j++;
	}
	return true;
    }

    public static int[] createIntArrays(Random random, int size)
    {
	int[] intArray = new int[size];
	for (int i = 0; i < intArray.length; i++)
	{
	    intArray[i] = random.nextInt();
	}
	return intArray;

    }

    public static void printArray(int[] t)
    {
	System.out.println("array size is: " + t.length + " values are:");
	for (int i : t)
	{
	    System.out.print(i + " ");
	}
    }

    
    public static boolean isSortedArray(Integer[] test)
    {
	int i = 0;
	int j = 1;
	while (j < test.length)
	{
	    if (test[i] > test[j])
	    {
		System.out.println("\n 前一个值：" + test[i] + "大于" + "后一个值："
			+ test[j]);
		return false;
	    }
	    i++;
	    j++;
	}
	return true;
    }

    public static Integer[] createIntergerArrays(Random random, int size)
    {
	Integer[] intArray = new Integer[size];
	for (int i = 0; i < intArray.length; i++)
	{
	    intArray[i] = random.nextInt();
	}
	return intArray;

    }

    public static void printArray(Integer[] t)
    {
	System.out.println("array size is: " + t.length + " values are:");
	for (int i : t)
	{
	    System.out.print(i + " ");
	}
    }
    
    
    public static void swap(Integer[] beSorted, int big, int little)
    {
	int temp = beSorted[big];
	beSorted[big] = beSorted[little];
	beSorted[little] = temp;

    }
}