K某

摘要： 1 #include<iostream> 2 using namespace std; 3 void InsertSort(int a[],int n) 4 { 5 for(int i = 1;i<n;i++) 6 { 7 int k = i; 8 int pre = i-1; 9 int cur 阅读全文

摘要： 1 #include<iostream> 2 using namespace std; 3 Paritition(int A[], int low, int high) { 4 int pivot = A[low]; 5 while (low < high) { 6 while (low < hig 阅读全文