java冒泡排序

java冒泡排序

public static void main(String[] args) {
		 int[] numbers = new int[]{102, 338, 62, 913, 580, 666};
		 for (int i = 0; i < numbers.length; i++) {
			for (int j = i+1; j < numbers.length; j++) {
				if(numbers[i]<numbers[j]){
					int t=numbers[i];
					numbers[i]=numbers[j];
					numbers[j]=t;
				}
			}
			System.out.println(numbers[i]);
		}
	}

下面是看到一个有意思的排序方法 <<<<<<休眠排序>>>>>>

public class Test4 implements Runnable {
    private int number;
    public Test4(int number) {
        this.number = number;
    }
    long a =System.currentTimeMillis();
    public static void main(String[] args) {
        int[] numbers = new int[]{102, 338, 62, 913, 580, 666};
        for (int number : numbers) {
            new Thread(new Test4(number)).start();
        }
    }
    public void run() {
        try {
            Thread.sleep((this.number/10));
            System.out.println(this.number);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
}