排序常用-冒泡和选择排序

为什么80%的码农都做不了架构师？>>>   

/**
	 * 选择排序法
	 * @param numbers 原始数组
	 * @return  排序完成的数组
	 */
	public int[] pickFun(int[] numbers) {

		for (int i = 0; i < numbers.length; i++) {
			for (int j = 0; j < numbers.length - 1; j++) {
				int temp;
				if (numbers[j] > numbers[j + 1]) {
					temp = numbers[j + 1];
					numbers[j + 1] = numbers[j];
					numbers[j] = temp;
				}
			}
		}
		return numbers;
	}
	
	/**
	 * 冒泡排序法 
	 * @param numbers
	 * @return 
	 */
	public int [] maopaoup(int [] numbers){
		int temp = 0;
		for (int i = 0; i < numbers.length; ++i) {
			for (int j = numbers.length - 1; j > i; --j) {
				if (numbers[j] < numbers[j - 1]) {
					temp = numbers[j];
					numbers[j] = numbers[j - 1];
					numbers[j - 1] = temp;

				}

			}
		}
		return numbers;
	}

转载于:https://my.oschina.net/kimilo/blog/57972