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

package hark.sort.exchangesort;

import java.util.Random;


/*
 * Bogo排序
 */
public class BogoSort {
	public static void main(String[] args) {
		int[] arrayData = { 2, 4, 8, 9, 1 };
		BogoSortMethod(arrayData);
		for (int integer : arrayData) {
			System.out.print(integer);
			System.out.print(" ");
		}
	}

	public static void BogoSortMethod(int[] arrayData) {
		while (!WhetherSort(arrayData)) {
			Sort(arrayData);
		}
	}

	static Random random = new Random();
	static int temp,swapIndex;

	public static void Sort(int[] arrayData) {
		for (int i = 0; i < arrayData.length; i++) {
			swapIndex = random.nextInt(i + 1);
			temp = arrayData[i];
			arrayData[i]= arrayData[swapIndex];
			arrayData[swapIndex] = temp;
		}
	}

	public static boolean WhetherSort(int[] arrayData) {
		for(int i = 0;i<arrayData.length-1;i++)
		{
			if(arrayData[i]> arrayData[i+1])
			{
				return false;
			}
		}
		return true;
	}
}