快速排序算法Java实现 import java.util.Arrays; public class Solution { public static int[] sort(int[] nums) { quickSort(nums,0,nums.length-1); return nums; } public static void quickSort(int[] nums,int i,int j) { if(i>=j) return ; int l=i,r=j; int temp=nums[i]; while(l<r) { while(l<r&&nums[r]>=temp) r--; nums[l]=nums[r]; while(l<r&&nums[l]<=temp) l++; nums[r]=nums[l]; } nums[l]=temp; quickSort(nums,i,l-1); quickSort(nums,l+1,j); } public static void main(String[] args){ int[] nums = {1,4,5,7,9,3,10,6,2,8}; System.out.println(Arrays.toString(sort(nums))); } }