https://blog.youkuaiyun.com/shutingzaozh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/shutingzao/article/details/79540039https://blog.youkuaiyun.com/shutingzao/article/details/79540039shutingzaoTue, 13 Mar 2018 17:35:50 +0800https://blog.youkuaiyun.com/shutingzao/article/details/78481075https://blog.youkuaiyun.com/shutingzao/article/details/78481075shutingzaoWed, 08 Nov 2017 17:21:48 +08002则交换数据值，否则不变，依次继续，第n为数就和前面n - 1位数逐个比较大小，最终组成一组从小到大的有序数。 代码： 方法一：int insertionSort(int a[],int len){ int i,j,k,num,temp; for(i = 2;i < len;i++){ a[0] = a[]]>https://blog.youkuaiyun.com/shutingzao/article/details/78478490https://blog.youkuaiyun.com/shutingzao/article/details/78478490shutingzaoWed, 08 Nov 2017 14:32:35 +0800 #include//从小到大排序 int bubbleSort(int a[],int len){ int i,j,k,temp,l; for]]>https://blog.youkuaiyun.com/shutingzao/article/details/78470084https://blog.youkuaiyun.com/shutingzao/article/details/78470084shutingzaoTue, 07 Nov 2017 17:18:58 +0800https://blog.youkuaiyun.com/shutingzao/article/details/78343371https://blog.youkuaiyun.com/shutingzao/article/details/78343371shutingzaoWed, 25 Oct 2017 16:50:12 +0800https://blog.youkuaiyun.com/shutingzao/article/details/78287710https://blog.youkuaiyun.com/shutingzao/article/details/78287710shutingzaoThu, 19 Oct 2017 17:55:43 +0800https://blog.youkuaiyun.com/shutingzao/article/details/78284112https://blog.youkuaiyun.com/shutingzao/article/details/78284112shutingzaoThu, 19 Oct 2017 14:06:46 +0800 int sortArray(int *array,int account){ int temp; for(int i = 0;i < account;i++){ for(int j = i + 1;j < account;j++){ if(array[]]>https://blog.youkuaiyun.com/shutingzao/article/details/78272889https://blog.youkuaiyun.com/shutingzao/article/details/78272889shutingzaoWed, 18 Oct 2017 14:58:14 +0800