快速排序代码,Java代码库,德仔网

代码语言

代码分类

【Java】快速排序

作者: / 发布于2016/6/20/ 346

package quickSort;
 
public class quickSort {
    public static void printArray(char[] array)
    {
        for(char i : array)
        {
            System.out.print(i+"");
        }
        System.out.println("\n");
    }
     
    private static void quickSort(char sortarray[], int lowIndex,int highIndex)
    {
        int lo = lowIndex;
        int hi = highIndex;
        int mid;
        if(highIndex>lowIndex)
        {
            mid = sortarray[(lowIndex+highIndex)/2];
            while(lo<=hi)
            {
                while((lo<highIndex)&&(sortarray[lo]<mid))
                    ++lo;
                while((hi>lowIndex)&&(sortarray[hi]>mid))
                    --hi;
                if(lo<=hi)
                {
                    char temp = sortarray[lo];
                    sortarray[lo] = sortarray[hi];
                    sortarray[hi] = temp;
                    ++lo;
                    --hi;
                }
            }
             
            if(lowIndex<hi)
                quickSort(sortarray,lowIndex,hi);
            if(lo<highIndex)
                quickSort(sortarray,lo,highIndex);
        }
         
    }
     
    public static void main(String[] args)
    {
        char[] array = {'a','b','f','e','g','d','h','c','j','i'};
        System.out.println("原有数组内容：");
        printArray(array);
        quickSort(array,0,array.length - 1);
        System.out.println("正序排列数组：");
        printArray(array);
    }
     
}

试试其它关键字

同语言下

可能有用的

贡献的其它代码Label