冒泡排序:
public void bubbleSort(int[] nums){
int n = nums.length();
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1-i;j++){
if(nums[j]>nums[j+1]){
swap(nums[j],nums[j+1]);
}
}
}
}
快速排序:
public void quickSort(int[] nums, int start, int end){
if(start<end){
int base = part(nums,start,end);
quickSort(nums,start,base-1);
quickSort(nums,base+1,end);
}
}
public int part(int[] nums, int start, int end){
int pivot = nums[start];
while(start<end){
while(nums[end]>pivot&&start<end){
end--;
}
swap(nums[start],nums[end]);
while(nums[start]<=pivot&&start<end){
start++;
}
swap(nums[start],nums[end]);
}
nums[start]=pivot;
return start;
}