算法
文章平均质量分 77
mdlyyh
Stay hungry,stay foolish
展开
-
A Simple In-Place Algorithm for In-Shuffle 一种简单的原地洗牌算法
只是把这篇文章前3部分翻译了,由于是学通信的,很多计算机术语可能翻译的不对,对文章内容理解偏差也可能会导致翻译错误,若发现,请指正,方便我更正! 1引文 通过把一副牌均分为两半,让后一半交错插入前一半,并且以后一半牌的第一张作为洗牌后的第一张牌的方法可以完成洗牌任务。以2n张牌为例,这种情况下会出现如下的置换(permutation): i → 2i mod (翻译 2014-01-11 15:27:36 · 1943 阅读 · 0 评论 -
洗牌算法2-分治
###Solution 2 、Perfect shuffle algorithmWho has played poker knows,an in-shuffle of a deck of cards is done by cutting the deck into two equal halves and interleaving them perfectly, with the first翻译 2014-03-01 10:54:48 · 1033 阅读 · 0 评论 -
洗牌算法3-完美洗牌算法
#### 2.3、Perfect shuffle algorithm perfect_shuffle3##### 2.3.1、cycle_leader algorithmEither perfect_shuffle1, or perfect_shuffle2, these two algorithms do not reach the time complexity of O (N) an翻译 2014-03-01 14:23:42 · 944 阅读 · 0 评论 -
洗牌算法1-蛮力搜索
中文版本见https://github.com/lmdyyh/The-Art-Of-Programming-By-July/tree/master/ebook/zhTopic Details:There is an array of length 2n {a1, a2, a3, ..., an, b1, b2, b3, ..., bn}, hope to be {a1, b1, a2, b翻译 2014-03-01 10:49:29 · 908 阅读 · 0 评论 -
洗牌算法-神级算法来源
##### 2.3.5、How comes the Magic Conclusion?Our problem has been resolved, but this chapter has not been completed,how comes the Magic Conclusion that determines the perfect shuffle algorithm: if翻译 2014-03-01 20:45:25 · 1041 阅读 · 0 评论 -
寻找最小的K个数
今天看到一篇文章,http://blog.csdn.net/v_JULY_v/article/details/6370650原创 2014-03-05 18:33:29 · 913 阅读 · 0 评论 -
亲和数问题--求解500万以内的亲和数之—Scheme语言实现
https://github.com/julycoding/The-Art-Of-Programming-By-July/blob/master/ebook/zh/06.0.md原创 2014-03-06 19:46:45 · 1304 阅读 · 0 评论