Divide & Conquer Explained simplistically

Idea Behind

If given a problem of size "n" divide it into number of "a" subproblems of size "n/b"Where a >= 1 and b > 1 "b" should be strictly greater than one so that notion of dividing problem into smaller problems is fulfilled. Solve subproblems recursively. Idea behind is that when you divide problems into subproblems it almost becomes constant in size and becomes easy to solve. In last stage you combine all problems and get solution. 
T(n) = aT(n/b) + [Work required for merge]

Software engineer, Leading highly scalable product @scale of million records per day.