public class Solution {
public int Main(int nums) {
QuickSort(nums,0,nums.Length-1)
}
public void QuickSort(int[] nums,int left,int right){
if(left >= right) return;
int temp;
int i = left;
int j = right;
int key = nums[left];
while(true){
while(nums[i] < key){
i++;
}
while(nums[j] > key){
j++;
}
if(i >= j) break;
temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
QuickSort(nums,left,j);
QuickSort(nums,j+1,right);
}
}
C# 快速排序(仅展示代码)
最新推荐文章于 2022-09-07 19:13:49 发布