代码如下。
public class quick sort { publicstaticvoidmain (stringdydkfdargs ) intdydkfdnums=newintdydkfd ) 23,383,9,84,13,55新Arrays.stream(nums ).Foreach ) system.out:3360println; }公共语音快速排序(intdydkfdnums,int start,int end ) if ) start=end ) return; int pivot=nums[start]; int i=start; int j=end; while(ij ) ) while ) Ijnums[j]=pivot ) ) j----; (if ) Ij ) ) { nums[i ]=nums[j]; }while(Ijnums[I]pivot ) ) I; (if ) Ij ) ) { nums[j--]=nums[i]; } } nums[i]=pivot; 快速排序(nums,start,i-1 ); 快速排序(nums,i 1,end ); }