几个排序算法

1.快速排序

public class quicksorts {
    public static List<Integer> quicks(List<Integer> nums)
    {
        if(nums.size()<2)
            return nums;
        final List<Integer> lower=new ArrayList<Integer>();
        final List<Integer> higher=new ArrayList<Integer>();
        final int pivot=nums.get(0);
        for(int i=1;i<nums.size();i++)
        {
            if(nums.get(i)>pivot)
                higher.add(nums.get(i));
            else lower.add(nums.get(i));
        }
        final List<Integer> con=quicks(lower);
        con.add(pivot);
        con.addAll(quicks(higher));
        return con;
    }
}

2.插入排序

public class insertsorts {
    public static List<Integer> ins(final List<Integer> nums)
    {
        List<Integer> insertsorted=new LinkedList<>();
        ori:for(int num:nums)
        {
            for(int  i=0;i<insertsorted.size();i++)
            {
                if(num<insertsorted.get(i))
                    {insertsorted.add(i,num);
                continue ori;}
            }
            insertsorted.add(insertsorted.size(),num);    
        }
        return insertsorted; 
    }
}

3.冒泡排序

public  class bubblesort {
    public static void bubblesorts(int[] nums)
    {
        boolean flag;
        do
        {
            flag=false;
            for(int i=0;i<nums.length-1;i++)
            {
                if(nums[i]>nums[i+1])
                {
                    int temp=nums[i+1];
                    nums[i+1]=nums[i];
                    nums[i]=temp;
                    flag=true;}
            }
        }while (flag);
        for(int j=0;j<nums.length;j++) 
          System.out.print(nums[j]+" ");            
    }
}

4.归并排序

public class mergesort {
    public static void sort1(int[] a,int low, int high, int[] temp)
    {
        if(low<high)
        {
        int mid=(low+high)/2;
        sort1(a,low,mid,temp);
        sort1(a,mid+1,high,temp);
        merge(a,low,mid,high,temp);
        }    
    }
    public static void merge(int[] a,int low, int mid,int high,int[] temp)
    {
        int i=low;
        int j=mid+1;
        int k=0;
        while(i<=mid&&j<=high)
        {
            if(a[i]<a[j])
            temp[k++]=a[i++];
            else temp[k++]=a[j++];
        }
        while(i<=mid)
        {
            temp[k++]=a[i++];
        }
        while(j<=high)
        {
         temp[k++]=a[j++];
        }
         for(i=0; i<k; i++){
                a[low+i] = temp[i];
            }
    }
}