数据结构以及算法
文章平均质量分 83
李炼
这个作者很懒,什么都没留下…
展开
-
Fibonacci序列
http://www.cnblogs.com/flyinghearts/archive/2011/03/22/1991983.html转载 2011-05-11 10:42:00 · 607 阅读 · 0 评论 -
0-1矩阵中找0,1间隔矩阵
<br /> 例如从: 0 1 0 1 0 中找出最大0,1间隔矩阵,结果应用从第一行第一列到第三行第四列的矩阵 0 1 0 1 ,算法实现参照从0-1矩阵中找全<br /> 1 0 1 0 0原创 2011-04-27 12:17:00 · 2336 阅读 · 0 评论 -
Finding Second Minimum element in an Array
<br /><br />How would you find minimum element in an array (non-repeating random numbers) ? Well, the solution is obvious, you pick first element and compare with the next and keep the lower of the two. Do this again by comparing result of first comparison转载 2011-05-06 10:53:00 · 938 阅读 · 0 评论 -
Finding Kth Minimum (partial ordering) – Using Tournament Algorithm
<br />Ok, so far in my previous blog entries about finding 2nd minimum (and for repeating elements) I wrote about efficient algorithm for finding second minimum element of an array. This optimized algorithm takes O(n + log(n)) time (worst case) to find the转载 2011-05-06 10:56:00 · 1550 阅读 · 0 评论 -
KD Tree - Searching in N-dimensions
<br />K-d tree for multi-dimensional nearest neighbours<br /> <br />http://www.codeproject.com/KB/architecture/KDTree.aspx转载 2011-05-06 17:17:00 · 895 阅读 · 0 评论