摘要:
快速排序(算法导论版) include using namespace std; void swap(int &a,int &b){ int temp = a; a = b; b = temp; } int parttion(int a[],int l,int r){ int x = a[r]; / 阅读全文
摘要:
``` include using namespace std; int a[11] = {10,9,8,6,3,7,2,1,1,4,5}; void selectSort(int a[],int n){ //选择排序 int min,index; for(int i = 0;i a[j]) { m 阅读全文