Java实现快速排序算法

package xiaoling;
public class QuickSort{
        public static void main(String[] args){
                int[] nums = new int[20];
                for (int loc = 0; loc < nums.length; ++loc){
                        nums[loc] = (int) (Math.random() * 100) + 5;
                }
                for (int num: nums) System.out.print(num + " ");
                System.out.println("
-----------------------");
                QS(nums, 0, nums.length-1);
                for (int num: nums) System.out.print(num + " ");
                System.out.println();
        }
        public static  void QS(int[] nums, int low, int high){
                if (low >= high) return;
                int mid = getMiddle(nums, low, high);
                QS(nums, mid+1, high);
                QS(nums, 0, mid-1);
        }
        public static int getMiddle(int[] nums, int low, int high){
                int temp = nums[low];
                while (low < high){
                        while (low < high && nums[high] >= temp) --high;
                        nums[low] = nums[high];
                        while (low < high && nums[low] <= temp) ++low;
                        nums[high] = nums[low];
                }
                nums[low] = temp;
                return low;
        }
}

运行结果：