摘要: 选择排序 1 void Select(int *a,int n) 2 { 3 for (int i = 0; i < n; i++) 4 { 5 int lowindex = i; 6 for (int j = i + 1; j < n; j++) 7 { 8 if (a[j] < a[lowindex]) 9 lowindex = j;10 swap(&a[i], &a[lo... 阅读全文
posted @ 2012-08-08 17:57 RightDear 阅读(174) 评论(0) 推荐(0)