快速排序和插入排序——我的代码

快速排序:

package suanfa;

import java.util.Scanner;

public class QuickSort {

    public static int sortOnce(int array[],int low,int high) {
        
        int temp=array[low];
        while(low<high) {
            while(low<high&&array[high]>=temp)high--;
            array[low]=array[high];
            while(low<high&&array[low]<=temp)low++;
            array[high]=array[low];
        }
        array[low]=temp;
        return low;
    }
    public static void QuickSortFun(int array[],int low,int high) {
        if(low<high) {
            int mark = sortOnce(array,low,high);
            QuickSortFun(array,low,mark-1);
            QuickSortFun(array,mark+1,high);
        }
    }
    
    public static void main(String[] args) {
        int array[]=new int[10];
        int num=0;
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNext()) {
            array[num++]=scanner.nextInt();
        }
        int newArray[]=new int[num];
        for(int i=0;i<num;i++) {
            newArray[i]=array[i];
        }
        //int newArray[]=new int[]{6,2,5,3,7,9};
        QuickSortFun(newArray,0,newArray.length-1);
        for(int j=0;j<num;j++) {
            System.out.print(newArray[j]+" ");
        }
    }
}

插入排序：

package suanfa;

public class InsertSort {

    public static void insertSortFun(int array[]) {
        int length=array.length;
        int i,j;
        for(i=1;i<length;i++) {
            int temp=array[i];
            for(j=0;j<=i;j++) {
                if(array[j]<array[i]) {
                    continue;
                }else {
                    break;
                }
            }
            for(int k=i-1;k>=j;k--) {
                array[k+1]=array[k];
            }
            array[j]=temp;
        }
    }
    
    public static void main(String[] args) {
                int newArray[]=new int[]{6,2,5,3,7,9};
                insertSortFun(newArray);
                for(int j=0;j<6;j++) {
                    System.out.print(newArray[j]+" ");
                }
    }
}