java实现三种排序-冒泡排序、快速排序、插入排序

package com.lh.cn;

import java.util.Arrays;

public class Sort {
	public static void BubbleSort(int[] args) {
		int n=0;
		for(int i=0;i<args.length;i++) {
			for(int j=0;j<args.length-1-i;j++) {
				n++;
				if(args[j+1]<args[j]) {
					int temp=args[j];
					args[j]=args[j+1];
					args[j+1]=temp;
					}
				System.out.println(i+" "+j+" "+n+" "+Arrays.toString(args));
			}
		}
	}
	public static void selectionSort(int[] args) {
		int n=0;
		for(int i=0;i<args.length;i++) {
			for(int j=i+1;j<args.length;j++) {
				n++;
				if(args[j]>args[i]) {
					int temp=args[i];
					args[i]=args[j];
					args[j]=temp;
				}
				System.out.println(i+" "+j+" "+n+" "+Arrays.toString(args));
			}
		}
	};
	public static void insertionSort(int[] args) {
		for(int i=1;i<args.length;i++) {
			for(int j=i-1;j>=0;j--) {
				if(args[j]>args[j+1]) {
					int temp=args[j];
					args[j]=args[j+1];
					args[j+1]=temp;
				}
				System.out.println(i);
			}
		}
	}
	public static void main(String[] args) {
		int[] initArray= {10,9,8,7,6,5,4,3,2,1};
		System.out.println(Arrays.toString(initArray));
		BubbleSort(initArray);
		System.out.println("------");
		System.out.println(Arrays.toString(initArray));
		selectionSort(initArray);
		System.out.println("------");
		System.out.println(Arrays.toString(initArray));
		insertionSort(initArray);
		System.out.println("------");
		System.out.println(Arrays.toString(initArray));
	}

}