07 2014 档案

2.11 2D平面最近点对问题[closest pair problem]
摘要：closest-pair-problem 阅读全文
posted @ 2014-07-11 18:01 hellogiser 阅读(3511) 评论(0) 推荐(1)
2.10 用最少次数寻找数组中的最大值和最小值[find min max of array]
摘要：find min max of array 阅读全文
posted @ 2014-07-11 09:22 hellogiser 阅读(3965) 评论(8) 推荐(0)
如何判断CPU字节序之[Big-endian vs Little-endian]
摘要：big-endian vs little-endian 阅读全文
posted @ 2014-07-10 12:12 hellogiser 阅读(1639) 评论(0) 推荐(0)
2.7 编程之美--最大公约数的3种解法[efficient method to solve gcd problem]
摘要：efficient method to solve gcd problem 阅读全文
posted @ 2014-07-08 16:54 hellogiser 阅读(1454) 评论(2) 推荐(0)
2.2 编程之美--不要被阶乘吓到[zero count of N factorial]
摘要：zero count of N factorial 阅读全文
posted @ 2014-07-08 10:53 hellogiser 阅读(1550) 评论(4) 推荐(1)
1.10 编程之美-双线程下载[double threads to download]
摘要：double threads to download and write 阅读全文
posted @ 2014-07-04 09:12 hellogiser 阅读(1233) 评论(2) 推荐(2)