sort.java

java排序算法：冒泡算法、选择算法、插入算法。

import java.math.*;

public class Sort {
	public static void main(String[] args) {
		int b[] = new int[100];
		for(int i=0;i<100;i++){
			 b[i] = (int)((Math.random()*100)%100);
		}
		System.out.println("生成随机数：");
		print(b);
		System.out.println();
		bubbleSort(b);
		print(b);
		System.out.println();
		selectionSort(b);
		print(b);
		System.out.println();
		insertionSort(b);
		print(b);
	}
	//冒泡排序
	public static int[] bubbleSort(int[] a)
	 {
	      int n=a.length;
		  
	      for(int i=0;i<n;i++)
		     {
		        for(int j=0;j<i;j++)
		        {
		           if(a[i] < a[j])
		           {
		           int t = 0;
		           t = a[j];
		           a[j] = a[i];
		           a[i] = t;
		           }
		        }
        }
	 System.out.println("冒泡排序算法：");	    
     return a;
     
	  }

	//选择排序
	public static int[] selectionSort(int[] a)
	 {
	      int n=a.length;
		  
	      for(int i=0;i<n;i++)
		  {
			   for(int j=i+1;j<n;j++)
			   {
				    if(a[i]>a[j])
				    {
				     int temp;
				     temp=a[i];
				     a[i]=a[j];
				     a[j]=temp;
				    }
			   }
		   }
	  System.out.println("选择排序算法：");
     return a;
     
	  }

	//插入排序
	public static int[] insertionSort(int[] a) 
    { 
        int n = a.length; 
        for (int i = 1; i  < n; i++) 
            { 
                int temp = a[i]; 
                int j; 
                for (j = i - 1; j >= 0 && temp  < a[j]; j--)
                    { 
                        a[j + 1] = a[j]; 
                    } 
                a[j + 1] = temp; 
            } 
        System.out.println("插入排序算法：");
        return a; 
    } 
	public static void print(int a[]){
		for(int j=0; j<a.length; j++)
			System.out.print(a[j]+" ");
	}
	
}