[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
【基本思想】:顺序的把待排序的数据元素按其关键字的大小插入到已排序数据元素的适当位置。自己和数据元素个数从只有一个数据元素开始,逐次增大,当子集合大小最终和集合大小相同时,排序结束。
插入排序的理解关键在于理解下面三个问题:
1.往哪里进行插入
2.把哪个值进行插入
3.怎么实现插入的
答:通过for循环从0到n-1进行遍历,前i为是排好序的,所以要进行的是将第i+1位与前i进行对比查找插入位置,在比较的时候,把前面的逐个后移,第i位覆盖第i+1位,第i-1位覆盖第i位以此类推。
void InsertSort(DataType a[],int n) { int i,j; DataType temp; for(i = 0;i <
n-1;i++) { temp = a[i+1];//定位第i+1位的数据,用于查找位置后的交换,避免移位时被覆盖 j = i;
//用于第i+1位与前i位进行对比时的下标递减遍历。 while(j > -1 && temp.key < a[j].key) { a[j+1] =
a[j]; j--; } a[j+1] = temp; } }
初始数组645789624
第一次排序564789624
第二次排序576489624
第三次排序576489624
第四次排序567648924
第五次排序567246489
红色为每次排序后前i位已排序区域,紫色位将要插入的数值
不难看出来,其最好的情况下的时间复杂度位O(n);最坏的情况下位O(n^2);