RongT

摘要： 1 #include 2 #define N 10 3 4 void QuickSort(int a[],int left, int right); 5 int BinSearch(int a[], int low, int high, int key); 6 int main() 7 { 8 int a[N] = {2,8,4,9,7,6,5,3,1,0}; 9 ... 阅读全文

摘要： 1 #include 2 #define N 10 3 void swap(int *p1, int *p2); 4 void BubbleSort(int *a); 5 void SelectSort(int a[]); 6 void QuickSort(int *a, int left, int right); 7 int main(){ 8 int a[N] = {... 阅读全文