算法导论（二）之分治策略

一、最大子数组 1. 伪代码 FIND-MAXIMUM-SUBARRAY(A,low,high){ if high == low return (low,high,A[low]) else mid = (low + high) / 2 (left-low,left-high,left-sum) = FIND-MAXIMUM-SUBARRAY(A,low,mid) (right

>>阅读原文<<