![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Divide & Conquer
XWang2014_SK
这个作者很懒,什么都没留下…
展开
-
Divide & Conquer : Closest Pair Algo
Reference: http://www.cs.ucsb.edu/~suri/cs235/ClosestPair.pdf原创 2013-02-25 12:12:04 · 232 阅读 · 0 评论 -
CareerCup 5.7
An array A[1...n] contains all the integers from 0 to n except for one number which is missing. In this problem, we cannot access an entire integer in A with a single operation. The elements of A ar原创 2013-02-26 17:12:03 · 248 阅读 · 0 评论 -
Divide & Conquer: Integer Multiplication
D & C reference: http://www.cs.berkeley.edu/~vazirani/algorithms/chap2.pdf中文参考: http://www.gdcp.cn/jpkc/sjjg/app/jm/bignumber_mul/solution.htm原创 2013-02-25 13:39:56 · 563 阅读 · 0 评论