Ta上传的资源 (0)

递归关系 求解方法 置换法(Substitution) Make a guess and verify it(假设-论证). 递归树(Recursion Tree) Allows us to arrive at a guess(帮助猜想). The guess can then be verifie

分治法(Divide and Conquer) Our first design strategy: Divide and Conquer(算法设计策略) Often recursive, at least in definition(通常是递归形式的) Strategy(策略思想): Break