<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:media="http://search.yahoo.com/mrss/"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>实现 - 四号程序员</title>
	<atom:link href="https://www.coder4.com/archives/tag/%e5%ae%9e%e7%8e%b0/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Mon, 18 Mar 2013 09:46:55 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.8.3</generator>
	<item>
		<title>算法技术手册 – 排序 – 选择排序</title>
		<link>https://www.coder4.com/archives/2167</link>
					<comments>https://www.coder4.com/archives/2167#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sun, 18 Sep 2011 09:50:50 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[排序]]></category>
		<category><![CDATA[算法技术手册]]></category>
		<category><![CDATA[选择排序]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=2167</guid>

					<description><![CDATA[选择排序，思想非常简单，分为selectMax和selectSort两个部分。 selectMax： 每次选择区间内最大的数，返回其Index selectSort 1、从右到左依次扫描i（除idx=0，因为选到最后，最小的一定在最左边），规定区间为[0, i] 2、调用selectMax，获得最大的maxIndex。 3、这个i位置应该是第i大的数的位置，也就是maxIndex的数的位置，因此，如果i!=maxIndex，swap之。 算法复杂度，不管是最坏、平均还是最好[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/2167/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>MurmurHash3的官方实现</title>
		<link>https://www.coder4.com/archives/2124</link>
					<comments>https://www.coder4.com/archives/2124#comments</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Mon, 05 Sep 2011 13:29:38 +0000</pubDate>
				<category><![CDATA[C && C++]]></category>
		<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[BloomFilter]]></category>
		<category><![CDATA[MurmurHash]]></category>
		<category><![CDATA[MurmurHash3]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[开源]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=2124</guid>

					<description><![CDATA[首先声明，根据我的实验测试，MurmurHash并非碰撞效率最好的，但确实是速度非常非常快的。 我将基于C++和如下的官方实现，开发BloomFilter并开源，尽请关注。 http://smhasher.googlecode.com/svn/trunk/MurmurHash3.h http://smhasher.googlecode.com/svn/trunk/MurmurHash3.cpp[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/2124/feed</wfw:commentRss>
			<slash:comments>2</slash:comments>
		
		
			</item>
		<item>
		<title>Bloom Filter实现的一些文章</title>
		<link>https://www.coder4.com/archives/2083</link>
					<comments>https://www.coder4.com/archives/2083#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Wed, 17 Aug 2011 15:04:21 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[BKDR]]></category>
		<category><![CDATA[Bloom Filter]]></category>
		<category><![CDATA[ELF]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[算法]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=2083</guid>

					<description><![CDATA[1、给出了Java实现，用Random做为一致性哈希算法。。。 http://blog.locut.us/2008/01/12/a-decent-stand-alone-java-bloom-filter-implementation/ 2、分析比较到位： http://blog.csdn.net/jiaomeng/article/details/1495500 3、这个写的也不错 http://www.cnblogs.com/heaad/archive/2011/01/02/[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/2083/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>实现Bloom Filter必读</title>
		<link>https://www.coder4.com/archives/2080</link>
					<comments>https://www.coder4.com/archives/2080#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Wed, 17 Aug 2011 13:35:58 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[Bloom Filter]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[教程]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=2080</guid>

					<description><![CDATA[转载自： 众所周知的原因，帮大家把这篇文章转载过来，写的很好。 It seems like Bloom filters are all the rage these days. Three years ago I had barely heard of them and now it seems like I see articles and code using them all the time. That's mostly a good thing, since bloom f[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/2080/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Naive Bayes的Python实现</title>
		<link>https://www.coder4.com/archives/1511</link>
					<comments>https://www.coder4.com/archives/1511#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Tue, 03 May 2011 02:37:09 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[Naive Bayes]]></category>
		<category><![CDATA[Python]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[朴素]]></category>
		<category><![CDATA[源代码]]></category>
		<category><![CDATA[贝叶斯]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=1511</guid>

					<description><![CDATA[明天考试，可以带电脑，先写好了程序，省的按计算器……直接上Python的源代码。 [python] #Naive Bayes #Calculate the Prob. of class:cls def P(data,cls_val,cls_name=&#34;class&#34;): cnt = 0.0 for e in data: if e[cls_name] == cls_val: cnt += 1[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/1511/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>在GTK中，如果定时让程序去作某件事，使用g_timeout_add</title>
		<link>https://www.coder4.com/archives/1049</link>
					<comments>https://www.coder4.com/archives/1049#comments</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 09 Oct 2010 02:50:28 +0000</pubDate>
				<category><![CDATA[Linux]]></category>
		<category><![CDATA[gtk]]></category>
		<category><![CDATA[图形界面开发]]></category>
		<category><![CDATA[多线程]]></category>
		<category><![CDATA[定时]]></category>
		<category><![CDATA[定时去做某事]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[源代码]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=1049</guid>

					<description><![CDATA[转载自：http://blog.csdn.net/ustcxiangchun/archive/2009/09/01/4508086.aspx 这个例子的作用就是把当前时间显示到窗口中，即显示了一个实时时钟。 //~~~~~~~ begin of program ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ #include &#60;cairo.h&#62; #include &#60;gtk/gtk.h&#62; #include &#60;time.h[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/1049/feed</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
		<item>
		<title>使用Crypto++进行RSA加密</title>
		<link>https://www.coder4.com/archives/577</link>
					<comments>https://www.coder4.com/archives/577#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Wed, 24 Mar 2010 08:58:15 +0000</pubDate>
				<category><![CDATA[Linux]]></category>
		<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[C]]></category>
		<category><![CDATA[Crypto++]]></category>
		<category><![CDATA[rsa]]></category>
		<category><![CDATA[加密.开源]]></category>
		<category><![CDATA[实现]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=577</guid>

					<description><![CDATA[Crypto++理论上可以在任何平台上编译，但是作者似乎是个Windows控，默认只生成静态库。当在Linux下编译的时候，需要打个patch给GNUmakefile，然后才能生成.so动态库。 补丁见这里，请爬梯子，注意安全～ http://groups.google.com/group/cryptopp-users/browse_thread/thread/6d37437aa40fc135?pli=1 对了，编译时候记得参数 -lcryptopp -lpthread 包装类RSATool[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/577/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>全排列的C语言描述-递归实现</title>
		<link>https://www.coder4.com/archives/84</link>
					<comments>https://www.coder4.com/archives/84#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Thu, 26 Nov 2009 08:30:49 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[c语言]]></category>
		<category><![CDATA[全排列]]></category>
		<category><![CDATA[实现]]></category>
		<category><![CDATA[递归]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=84</guid>

					<description><![CDATA[递归实现全排列: #include #define N 4 int used[N]; int out[N]; void f(int *num,int n,int p); int main() { int num[N],i; for(i=0;i[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/84/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>八皇后问题的c语言描述</title>
		<link>https://www.coder4.com/archives/80</link>
					<comments>https://www.coder4.com/archives/80#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Thu, 26 Nov 2009 08:26:10 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[c语言]]></category>
		<category><![CDATA[八皇后]]></category>
		<category><![CDATA[实现]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=80</guid>

					<description><![CDATA[没有做优化，纯回溯，自己写的。 八皇后问题的c语言描述： #include #include int a[9]={0,0,0,0,0,0,0,0,0},count=0; void f(int n);//核心 void op();//这个是找到满足条件的解的时候输出 int ct(int n);//这个函数判断是否有冲突 int main() { f(1); printf(&#34;\n共有%d个解&#34;,count); return 0; } void f(int n)[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/80/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
