算法拾忆(一)：选择排序

//数组作为参数传递时会退换成指针int a[] ---int *avoid printfArray(int a[],int num);void sortArray(int a[],int num);int main(){int a[10] = {19,32,1,4,6,8,0,13,5,2};printf("before sort the array:\n");printfArray(a,10);sortArray(a,10);printf("after sort the array:\n");printfArray(a,10);}//打印出数组void printfArray(int a[],int num){int i = 0;for (i = 0; i < num; i++){printf("a[%d]=%d  ",i,a[i]);}}//用选择排序 排序数组void sortArray(int a[], int num){int i, j;//外层for循环控制循环次数for (i = 0; i < num-1; i++){//内层for循环 ；hold住i 不变 改变j值依次比较for (j = i + 1; j < num; j++){if (a[i]>a[j]){int temp = a[i];a[i] = a[j];a[j] = temp;}}}}