排序算法

阅读更多

package a;

public class Sort {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] array2 = { 49, 38, 65, 97, 26, 13, 27, 49, 55, 04 };
		Sort sort = new Sort();
		printArray(array2);
		Sort.shellSort(array2);

	}

	public static int[] insertSort(int[] array) {
		for (int j = 1; j < array.length; j++) {
			int key = array[j];
			int i = j - 1;
			while (i >= 0 && array[i] > key) {
				array[i + 1] = array[i];
				i = i - 1;
				array[i + 1] = key;
			}
		}
		return array;
	}

	public static void shellSort(int array[]) {
		int i, j, gap;
		int n = array.length;
		for (gap = n / 2; gap > 0; gap /= 2) {
			// 步长
			for (i = 0; i < gap; i++) // 直接插入排序
			{
				for (j = i + gap; j < n; j += gap)
					if (array[j] < array[j - gap]) {
						int temp = array[j];
						int k = j - gap;
						while (k >= 0 && array[k] > temp) {
							array[k + gap] = array[k];
							k -= gap;
						}
						array[k + gap] = temp;
					}
			}
			printArray(array);
		}
	}

	public static void printArray(int[] array) {
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i] + ",");
		}
		System.out.println();
	}
}