java中各种排序的实现 不断更新

import java.util.Scanner;

public class BubbleSortDemo {//冒泡排序

	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		System.out.println("输入要排序的数的个数：");
		
		Scanner sc = new Scanner(System.in);
		
		int sum = sc.nextInt();
		int [] a = new int[sum];
		
		System.out.println("输入数据：");
		
		for(int i = 0; i<sum; i++)
		{
			a[i] = sc.nextInt();
		
		}
		
		bubbleSort1(a,a.length);
		System.out.println("排序后为：");
		for(int i = 0; i<sum; i++)
		{
			System.out.print(a[i]+" ");
		
		}
		

	}
	
	public static void bubbleSort(int[] a ) 
	{//直接排序
		for(int i =0; i<a.length-1; i++)
		{
			for(int j = i; j<a.length-1; j++)
			{
				if(a[i]>a[j+1])
				{
					int temp;
					temp = a[i];
					a[i] = a[j+1];
					a[j+1] = temp;
				
				}
			}
			
		
		}
	}
	
	public static void bubbleSort1(int[] a,int length)
	{//递归排序
		if(length == 1)
			return ;
		for(int i = 0; i<length -1; i++)
		{
			if(a[i]>a[i+1])
			{
				int temp = a[i];
				a[i] = a[i+1];
				a[i+1] = temp;
			
			}
		
		}
		bubbleSort1(a,length-1);
	}

}