![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Introduction to algorithms 3rd思考
文章平均质量分 77
xiahuixia111
这个作者很懒,什么都没留下…
展开
-
2.1-4习题总结
习题是这个样子的: Consider the problem of adding two n-bit binary integers, stored in two n-element arrays A and B.The sum of the two integers should be stored in binary form in an (n+1)-element array C.Sta原创 2014-01-08 19:59:40 · 766 阅读 · 0 评论 -
算法导论第三版4.1最大和子数组思考
对于maximum_subarray的分治算法: #include #include #include #include using namespace std; int max_crossing_subarray(int A[], int low, int mid, int high, int& sub_low, int& sub_high) { int sum = 0; int原创 2014-02-10 15:38:53 · 811 阅读 · 0 评论