https://blog.youkuaiyun.com/Specialskillzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Specialskill/article/details/147337104https://blog.youkuaiyun.com/Specialskill/article/details/147337104SpecialskillFri, 18 Apr 2025 17:21:20 +0800https://blog.youkuaiyun.com/Specialskill/article/details/144825932https://blog.youkuaiyun.com/Specialskill/article/details/144825932SpecialskillTue, 07 Jan 2025 20:01:16 +0800https://blog.youkuaiyun.com/Specialskill/article/details/142066405https://blog.youkuaiyun.com/Specialskill/article/details/142066405SpecialskillThu, 05 Dec 2024 20:44:02 +0800https://blog.youkuaiyun.com/Specialskill/article/details/144091110https://blog.youkuaiyun.com/Specialskill/article/details/144091110SpecialskillThu, 05 Dec 2024 20:42:22 +0800https://blog.youkuaiyun.com/Specialskill/article/details/132635372https://blog.youkuaiyun.com/Specialskill/article/details/132635372SpecialskillSat, 02 Sep 2023 10:33:48 +0800https://blog.youkuaiyun.com/Specialskill/article/details/131114367https://blog.youkuaiyun.com/Specialskill/article/details/131114367SpecialskillThu, 08 Jun 2023 19:39:40 +0800=2）元素作为一组，进行组内直接插入排序）然后缩减增量再进行排序，待整个序列中的元素基本有序，此时dk减至1，再对全体元素进行一次直接插入排序。希尔排序是基于直接插入排序的一种排序，实质就是分组插入排序，该方法又称递减增量排序算法，因DL．Shell于1959年提出而得名。③ 取第二个增量d2小于d1重复上述的分组和排序，直至所取的增量dt=1(dt小于dt-l小于…]]>