importjava.util.*;publicclassQuickSort{publicstaticvoidquickSort(int[]nums,intstart,intend){if(start<end){intpartitionIndex=partition(nums,start,end);quickSort(nums,start,partitionIndex-1);quickSort(nums,partitionIndex+1,end);}}publicstaticintpartition(int[]nums,intstart,intend){intpivot=nums[end];intpartitionIndex=start;for(inti=start;i<end;i++){// lesser than pivotif(nums[i]<=pivot){swap(nums,i,partitionIndex);partitionIndex+=1;}}swap(nums,end,partitionIndex);returnpartitionIndex;}publicstaticvoidswap(int[]nums,inti,intj){inttemp=nums[i];nums[i]=nums[j];nums[j]=temp;}publicstaticvoidmain(String[]args){int[]nums={5,3,2,12,100,11,1,5,6,7,83,4,45,56,7,4,3,1};quickSort(nums,0,nums.length-1);for(intnumber:nums){System.out.print(number+" ");}}}
Sharing my code for the quicksort
Thanks for sharing!
Will add this:)