https://blog.youkuaiyun.com/dfzzh5zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/dfzzh5/article/details/169839424https://blog.youkuaiyun.com/dfzzh5/article/details/169839424dfzzh5Mon, 02 Nov 2026 14:27:14 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/159888306https://blog.youkuaiyun.com/dfzzh5/article/details/159888306dfzzh5Mon, 06 Apr 2026 17:02:26 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/159833978https://blog.youkuaiyun.com/dfzzh5/article/details/159833978dfzzh5Sat, 04 Apr 2026 20:40:59 +08001时是预排序，gap==1时是直接插入排序。优化：从两边比较，既选出最大的，也选出最小的，放在两边，然后依次往中间收缩，直到到了中间就停止。本来是将第1个记为最小的，然后遍历，如果有更小的就交换，然后下一个记为最小的，依次类推。]]>https://blog.youkuaiyun.com/dfzzh5/article/details/159833604https://blog.youkuaiyun.com/dfzzh5/article/details/159833604dfzzh5Sat, 04 Apr 2026 20:19:16 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/159583652https://blog.youkuaiyun.com/dfzzh5/article/details/159583652dfzzh5Sat, 28 Mar 2026 17:41:43 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/159551244https://blog.youkuaiyun.com/dfzzh5/article/details/159551244dfzzh5Fri, 27 Mar 2026 20:11:23 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/159321726https://blog.youkuaiyun.com/dfzzh5/article/details/159321726dfzzh5Sat, 21 Mar 2026 19:50:08 +08000)个互不相交的集合T1,T2......Tm,其中每一个集合Ti(1<=i<=m)又是一棵结构与树类似的子树，每棵子树的根结点有且只有一个前驱，可以有0个或多个后继。对于深度为k的，有n个结点的二叉树，当且仅当每一个结点都与深度为k的满二叉树中编号从1到n的结点一一对应时称为完全二叉树。双亲节点或父节点：若一个节点含有子节点，则这个节点称为其子节点的父节点。孩子节点或子节点：一个节点含有的子树的根节点称为该节点的子节点。]]>https://blog.youkuaiyun.com/dfzzh5/article/details/159051659https://blog.youkuaiyun.com/dfzzh5/article/details/159051659dfzzh5Sat, 14 Mar 2026 20:24:26 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/157844617https://blog.youkuaiyun.com/dfzzh5/article/details/157844617dfzzh5Sat, 07 Feb 2026 22:24:51 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/157844253https://blog.youkuaiyun.com/dfzzh5/article/details/157844253dfzzh5Sat, 07 Feb 2026 19:25:38 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/157476787https://blog.youkuaiyun.com/dfzzh5/article/details/157476787dfzzh5Wed, 28 Jan 2026 19:53:42 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/156913966https://blog.youkuaiyun.com/dfzzh5/article/details/156913966dfzzh5Tue, 13 Jan 2026 23:04:24 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/155195914https://blog.youkuaiyun.com/dfzzh5/article/details/155195914dfzzh5Mon, 24 Nov 2025 16:19:24 +0800预处理-->中间文件.i-->编译-->中间文件.s-->汇编-->目标文件.o 和 链接库libc.a -->链接器-->可执行文件。带有副作用的宏参数：当宏参数在宏的定义中出现超过一次的时候，如果参数有副作用，表达式求值会出现永久性效果。通常包括声明和类型的匹配，类型的转换等。运行环境：程序载入内存中，调用main函数，使用一个运行时的堆栈（stack),也可以使用静态（static)内存，终止程序。但宏是没法调试的，每次调用宏的时候，一份宏定义的代码将插入到程序中。]]>https://blog.youkuaiyun.com/dfzzh5/article/details/155129231https://blog.youkuaiyun.com/dfzzh5/article/details/155129231dfzzh5Sat, 22 Nov 2025 16:32:21 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/154947009https://blog.youkuaiyun.com/dfzzh5/article/details/154947009dfzzh5Mon, 17 Nov 2025 15:33:06 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/154902263https://blog.youkuaiyun.com/dfzzh5/article/details/154902263dfzzh5Sun, 16 Nov 2025 10:44:01 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/154870836https://blog.youkuaiyun.com/dfzzh5/article/details/154870836dfzzh5Sat, 15 Nov 2025 11:40:19 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/154598516https://blog.youkuaiyun.com/dfzzh5/article/details/154598516dfzzh5Sun, 09 Nov 2025 10:53:43 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/153867066https://blog.youkuaiyun.com/dfzzh5/article/details/153867066dfzzh5Sat, 25 Oct 2025 10:48:13 +0800https://blog.youkuaiyun.com/dfzzh5/article/details/153515175https://blog.youkuaiyun.com/dfzzh5/article/details/153515175dfzzh5Sat, 18 Oct 2025 10:58:33 +0800