java排序算法

冒泡排序Java代码

public class bubbleSort{    public bubbleSort(){        int a[]={49,38,65,97,76,13,27,49,78,        34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53};        int temp=0;        for(int i=0;i<a.length-1;i++){            for(int j=0;j<a.length-1-i;j++){                if(a[j]>a[j+1]){                    temp=a[j];                    a[j]=a[j+1];                    a[j+1]=temp;                }            }        }    }}

快速排序java代码

public class quickSort{    int a[]={49,38,65,97,76,13,27,49,78,        34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53};    public quickSort(){        quick(a);        for(int i=0;i<a.length;i++){            System.out.println(a[i]);        }    }    public int getMiddle(int[] list,int low,int high){        int tmp=list[low];//数组的第一个作为中轴        while(low<high){              while(low<high&&list[high]>=tmp){                high--;              }              list[low]=list[high];//比中轴小的记录移到低端              while(low<high&&list[low]<=tmp){                low++;              }              list[high]=list[low];//比中轴大的记录移到高端        }        list[low]=tmp;//中轴记录到尾        return low;//返回中轴的位置    }   public void _quickSort(int[] list,int low,int high){         if(low<high){            int middle=getMiddle(list,low,high);//将list数组进行一分为二            _quickSort(list,low,middle-1);//将低字表进行行递归排序            _quickSort(list,middle+1,high);//对高字表进行递归排序         }   }   public void quick(int[] a2){        if(a2.length>0){//查看数组是否为空            _quickSort(a2,0,a2.length-1);        }       }}

选择排序java代码

public class selectSort{    public selectSort(){        int a[]={1,54,6,3,78,34,12,45};        int position=0;        for(int i=0;i<a.length;i++){            int j=i+1;            position=i;            int temp=a[i];            for(j<a.lenght;j++){                if(a[j]<temp){                    temp=a[j];                    positon=j;                }            }            a[position]=a[i];            a[i]=temp;        }        for(int i=0;i<a.length;i++){            System.out.println(a[i]);        }    }}