冒泡排序

package sort;

public class BubbleSort {

	private int[] array;
	private int maxSize;

	public BubbleSort(int maxSize) {
		this.array = new int[maxSize];
		this.maxSize = maxSize;
	}

	private int[] getRandomNum() {
		for (int i = 0; i < maxSize; i++) {
			array[i] = (int) Math.round(Math.random() * 1000);
		}
		return array;
	}

	private void getSortedNum() {
		int i, j;
		for (i = array.length - 1; i > 0; i--) {
			for (j = 0; j < i; j++) {
				if (array[j] > array[j + 1]) {
					swapNum(j, j + 1);
				}
			}
		}
	}

	// private void getSortedNum() {
	// int i, j;
	// for (i = 1; i < array.length; i++) {
	// for (j = 0; j < array.length - i; j++) {
	// if (array[j] > array[j + 1]) {
	// swapNum(j, j + 1);
	// }
	// }
	// }
	// }

	private void swapNum(int subScriptA, int subScriptB) {
		int tempNum;
		tempNum = array[subScriptA];
		array[subScriptA] = array[subScriptB];
		array[subScriptB] = tempNum;
	}

	public static class BubbleSortApp {
		public static void main(String[] args) {
			int maxSize = 1000;
			BubbleSort bs = new BubbleSort(maxSize);
			String strs = "";

			bs.getRandomNum();
			for (int i = 0; i < bs.array.length - 1; i++) {
				strs += bs.array[i] + ",";
			}
			strs += bs.array[bs.array.length - 1];
			System.out.println("sort :      " + strs);

			strs = "";
			bs.getSortedNum();

			for (int i = 0; i < bs.array.length - 1; i++) {
				strs += bs.array[i] + ",";
			}
			strs += bs.array[bs.array.length - 1];
			System.out.println("sorted : " + strs + "\n");
		}
	}
}

  

转载于:https://www.cnblogs.com/cloudwind/archive/2012/07/25/2608589.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值