空闲了 写几个简单的排序实现

</pre><pre name="code" class="java">/**
 * 冒泡排序
 */
public class BubbleSort {
	public static void main(String[] args) {
		int[] array = { 28, 19, 91, 7, 4, 17 };
		System.out.print("排序前:");
		printArray(array);

		bubbleAscSort(array);
		bubbleDescSort(array);
	}

	/**
	 * 输出数组
	 */
	public static void printArray(int[] array) {
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i]);
			if (i != array.length - 1) {
				System.out.print(",");
			}
		}
	}

	/**
	 * 冒泡升序排序
	 */
	public static void bubbleAscSort(int[] array) {
		System.out.println();
		System.out.print("冒泡升序排序后:");
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length - 1; i++) {
			for (int j = i + 1; j < array.length; j++) {
				if (array[j] < array[i]) {
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
		printArray(array);
	}

	/**
	 * 冒泡降序排序
	 */
	public static void bubbleDescSort(int[] array) {
		System.out.println();
		System.out.print("冒泡降序排序后:");
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length - 1; i++) {
			for (int j = i + 1; j < array.length; j++) {
				if (array[j] > array[i]) {
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
		printArray(array);
	}
}

/**
 * 插入排序
 */
public class InsertSort {
	public static void main(String[] args) {
		int[] array = { 28, 19, 91, 7, 4, 17 };
		System.out.print("排序前:");
		printArray(array);

		insertAscSort(array);
		insertDescSort(array);
	}

	/**
	 * 插入升序排序
	 */
	public static void insertAscSort(int[] array) {
		System.out.println();
		System.out.print("插入升序排序后:");
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 1; i < array.length; i++) {
			for (int j = 0; j < i; j++) {
				if (array[j] > array[i]) {
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
		printArray(array);
	}

	/**
	 * 插入降序排序
	 */
	public static void insertDescSort(int[] array) {
		System.out.println();
		System.out.print("插入降序排序后:");
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 1; i < array.length; i++) {
			for (int j = 0; j < i; j++) {
				if (array[j] < array[i]) {
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
		printArray(array);
	}

	public static void printArray(int[] array) {
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i]);
			if (i != array.length - 1) {
				System.out.print(",");
			}
		}
	}
}

/**
 * 选择排序
 */
public class SelectSort {
	public static void main(String[] args) {
		int[] array = { 28, 19, 91, 7, 4, 17 };
		System.out.print("排序前:");
		printArray(array);

		selectAscSort(array);
		selectDescSort(array);
	}

	/**
	 * 选择升序排序
	 */
	public static void selectAscSort(int[] array) {
		System.out.println();
		System.out.print("选择升序排序后:");
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length - 1; i++) {
			int index = i;
			for (int j = i + 1; j < array.length; j++) {
				if (array[j] < array[index]) {
					index = j;
				}
			}
			if (index != i) {
				int temp = array[i];
				array[i] = array[index];
				array[index] = temp;
			}
		}
		printArray(array);
	}

	/**
	 * 选择降序排序
	 */
	public static void selectDescSort(int[] array) {
		System.out.println();
		System.out.print("选择降序排序后:");
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length - 1; i++) {
			int index = i;
			for (int j = i + 1; j < array.length; j++) {
				if (array[j] > array[index]) {
					index = j;
				}
			}
			if (index != i) {
				int temp = array[i];
				array[i] = array[index];
				array[index] = temp;
			}
		}
		printArray(array);
	}

	public static void printArray(int[] array) {
		if (array == null || array.length == 0) {
			return;
		}
		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i]);
			if (i != array.length - 1) {
				System.out.print(",");
			}
		}
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值