<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[naturerun的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/naturerun</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; naturerun]]></copyright><item><title><![CDATA[二进制基数树及其c++实现]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/169953368</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/169953368</guid><author>naturerun</author><pubDate>Wed, 04 Nov 2026 00:44:51 +0800</pubDate><description><![CDATA[二进制基数树]]></description><category></category></item><item><title><![CDATA[广义荷兰国旗问题及C++实现]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/164742984</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/164742984</guid><author>naturerun</author><pubDate>Wed, 09 Sep 2026 14:47:37 +0800</pubDate><description><![CDATA[广义荷兰国旗问题]]></description><category></category></item><item><title><![CDATA[荷兰国旗问题与三路划分的快速排序]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/164683104</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/164683104</guid><author>naturerun</author><pubDate>Wed, 09 Sep 2026 07:02:16 +0800</pubDate><description><![CDATA[荷兰国旗问题与三路划分快速排序介绍]]></description><category></category></item><item><title><![CDATA[逐步插入回路法构造欧拉回路的算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/163005056</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/163005056</guid><author>naturerun</author><pubDate>Sun, 19 Jul 2026 02:17:38 +0800</pubDate><description><![CDATA[逐步插入回路法构造欧拉回路的算法介绍]]></description><category></category></item><item><title><![CDATA[线性时间界的选择第k大元素的算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/161421684</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/161421684</guid><author>naturerun</author><pubDate>Tue, 26 May 2026 13:42:38 +0800</pubDate><description><![CDATA[线性时间的选择算法]]></description><category></category></item><item><title><![CDATA[从数组中删除元素的算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/160979310</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/160979310</guid><author>naturerun</author><pubDate>Mon, 11 May 2026 12:39:24 +0800</pubDate><description><![CDATA[从数组中删除元素的算法]]></description><category></category></item><item><title><![CDATA[螺旋形遍历奇数阶矩阵]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/160947713</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/160947713</guid><author>naturerun</author><pubDate>Sun, 10 May 2026 10:57:36 +0800</pubDate><description><![CDATA[奇数阶矩阵的螺旋形遍历]]></description><category></category></item><item><title><![CDATA[Batcher双调排序及其实现]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/160890759</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/160890759</guid><author>naturerun</author><pubDate>Fri, 08 May 2026 15:19:27 +0800</pubDate><description><![CDATA[Batcher双调排序算法介绍]]></description><category></category></item><item><title><![CDATA[最小生成树的Kruskal算法和Prim算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/157441064</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/157441064</guid><author>naturerun</author><pubDate>Tue, 27 Jan 2026 22:51:09 +0800</pubDate><description><![CDATA[最小生成树的kruskal算法和prim算法]]></description><category></category></item><item><title><![CDATA[从布尔函数的真值表构造二元决策图]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156875927</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156875927</guid><author>naturerun</author><pubDate>Tue, 13 Jan 2026 01:03:14 +0800</pubDate><description><![CDATA[二叉树的规模和复杂度随布尔变量的数目成指数级递增,会占用大量的内存空间，如上所述，采用二元决策图的布尔函数表示形式可以节省大量不必要的内存空间,使高效表示和存储布尔函数真值表成为可能。布尔函数的数字检索树是一棵满二叉树,二叉树的层数是布尔函数自变量数目加一,从上至下编号为i(从1开始)的层对应布尔函数的变量。为1时从右分支向下搜索,当抵达树的最低层时,最低层节点的布尔值就是布尔函数的求值结果..二叉树上每一个节点的左分叉表示0，右分叉表示1,如果节点代表布尔变量。为0时从左分支向下搜索,当。]]></description><category></category></item><item><title><![CDATA[空间数据结构K-D树]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156653672</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156653672</guid><author>naturerun</author><pubDate>Tue, 06 Jan 2026 17:45:37 +0800</pubDate><description><![CDATA[k-d树是二叉搜索树在k维空间中的扩展，其定义如下：
一棵k-d树要么是空树，要么是一棵满足如下性质的二叉树：
(1)每一个节点的数据域为k元有序组(N0,N1,N2,—,Nk-1)
(2)每一层i上的每一个节点(数据域为(N0,N1,—,Nk-1))的左子树中每一个节点的数据域(N’0,N’1,—,N’k-1)满足N’ (i-1 mod k)<N (i-1 mod k),右子树中每一个节点的数据域(N’0,N’1,—,N’k-1)满足N’ (i-1 mod k) >N (i-1 mod k),
二叉搜索树]]></description><category></category></item><item><title><![CDATA[BoyerMoore字符串匹配算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156546950</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156546950</guid><author>naturerun</author><pubDate>Sat, 03 Jan 2026 23:20:30 +0800</pubDate><description><![CDATA[BoyerMoore字符串匹配算法]]></description><category></category></item><item><title><![CDATA[RabinKarp字符串匹配算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156545341</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156545341</guid><author>naturerun</author><pubDate>Sat, 03 Jan 2026 22:27:45 +0800</pubDate><description><![CDATA[RabinKarp字符串匹配算法]]></description><category></category></item><item><title><![CDATA[用位运算枚举1-N的r组合]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156494252</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156494252</guid><author>naturerun</author><pubDate>Fri, 02 Jan 2026 01:29:50 +0800</pubDate><description><![CDATA[位运算枚举r组合]]></description><category></category></item><item><title><![CDATA[多线程(并行)归并排序的实现]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156493545</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156493545</guid><author>naturerun</author><pubDate>Fri, 02 Jan 2026 00:55:26 +0800</pubDate><description><![CDATA[多线程(并行)归并排序]]></description><category></category></item><item><title><![CDATA[基于矩阵分块乘法的多线程(并行)矩阵乘法的实现]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/156493265</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/156493265</guid><author>naturerun</author><pubDate>Fri, 02 Jan 2026 00:30:24 +0800</pubDate><description><![CDATA[并行矩阵乘法的实现]]></description><category></category></item><item><title><![CDATA[判断两个线段是否相交的计算几何算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/154961732</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/154961732</guid><author>naturerun</author><pubDate>Mon, 17 Nov 2025 23:13:07 +0800</pubDate><description><![CDATA[判断两线段是否相交的算法]]></description><category></category></item><item><title><![CDATA[tarjan LCA算法和基于+-RMQ和欧拉序列的LCA算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/154502398</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/154502398</guid><author>naturerun</author><pubDate>Thu, 06 Nov 2025 23:11:55 +0800</pubDate><description><![CDATA[基于±RMQ和欧拉序列的LCA算法的思路是构建树的欧拉序列,树上两个节点的LCA就是欧拉序列对应区间内深度最小的节点,且欧拉序列上相邻两项的深度值的差要么为1，要么为-1，所以LCA的查询可以用±RMQ做到.以下代码简单起见没有使用±RMQ  ±RMQ实现见。tarjan LCA算法讲解见。strToTree.h内容。]]></description><category></category></item><item><title><![CDATA[有向无环图的拓扑排序]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/154447074</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/154447074</guid><author>naturerun</author><pubDate>Wed, 05 Nov 2025 16:45:21 +0800</pubDate><description><![CDATA[需要提及的是，在使用队列生成拓扑排序时,之所以当剩下的顶点入度均不为0时图中存在有向圈，是因为从剩下顶点中的任意一个出发，沿顶点的入边走到下一个和已经过的顶点都不同的下一个顶点的过程是不可能永远进行下去的(因为剩下的顶点数目是有限的)，因而必然在某一步通过入边抵达的下一个顶点就是之前经过的顶点，从该顶点出发沿经过顶点的顺序的逆序前进，最终就回到了出发顶点，这就是一个有向圈。dfs求拓扑排序的算法思路是把有向无环图的顶点按dfs完成时间从大到小依次排列，所得的序列即为拓扑有序序列。]]></description><category></category></item><item><title><![CDATA[Kosaraju强连通分量算法]]></title><link>https://blog.youkuaiyun.com/naturerun/article/details/154417189</link><guid>https://blog.youkuaiyun.com/naturerun/article/details/154417189</guid><author>naturerun</author><pubDate>Wed, 05 Nov 2025 03:32:01 +0800</pubDate><description><![CDATA[Kosaraju强连通分量算法介绍和实现]]></description><category></category></item></channel></rss>