我一直在阅读有关递归和解决复发equations.Came跨越所谓减法而治之。它是如何从不同的分而治之technique.Can我解决这些类型的使用用于解决鸿沟相同的技术问题，并征服复发公式（如主定理或递归树）。

I have been reading about recursion and solving recurrence equations.Came across a term "subtract and conquer". How is it difference from "Divide and conquer" technique.Can i solve these kind of problems using the same techniques used for solving divide and conquer recurrence equations (like master theorem or recursion tree).

推荐答案

的主定理适用于分治法。有些算法导致形式为T（N）的复发= AT（NB）+Θ（ND）这些可能被称为减而治之或巨大的一步，小步算法。

"The master theorem applies to divide and conquer algorithms. Some algorithms lead to recurrences of the form T(n) = aT(n-b) + Θ(nd). These might be called "subtract and conquer" or "giant step, baby step" algorithms."

其实从鸿沟减去不同，子问题大小不分，但扣除，其他的都是类似的。

Actually subtract differs from divide, that size of sub problem not divided, but subtracting, everything else is the similar.

检查该链接查看更多细节的http://www.eecis.udel.edu/~saunders/courses/621/11s/notes/notes/Master-theorem.html

Check this link for more details http://www.eecis.udel.edu/~saunders/courses/621/11s/notes/notes/Master-theorem.html