Hark的数据结构与算法练习之奇偶排序

package hark.sort.exchangesort;

/*
 * 奇偶排序
 */
public class OddevenSort {
	public static void main(String[] args) {
		int[] arrayData = { 2, 3, 4, 5, 6, 7, 8, 9, 1 };
		OddevenSortMethod(arrayData);
		for (int integer : arrayData) {
			System.out.print(integer);
			System.out.print(" ");
		}
	}

	public static void OddevenSortMethod(int[] arrayData) {
		int temp;
		int length = arrayData.length;
		boolean whetherSorted = true;

		while (whetherSorted) {
			whetherSorted = false;
			for (int i = 1; i < length - 1; i++) {
				if (arrayData[i] > arrayData[i + 1]) {
					temp = arrayData[i];
					arrayData[i] = arrayData[i + 1];
					arrayData[i + 1] = temp;
					whetherSorted = true;
				}
			}

			for (int i = 0; i < length - 1; i++) {
				if (arrayData[i] > arrayData[i + 1]) {
					temp = arrayData[i];
					arrayData[i] = arrayData[i + 1];
					arrayData[i + 1] = temp;
					whetherSorted = true;
				}
			}
		}
	}
}