This technique involves breaking down a large problem into smaller subproblems, solving those subproblems, and combining the solutions to solve the original problem. It can be applied recursively or iteratively by decreasing the problem size by a constant amount each iteration. Examples where it is used include insertion sort, depth-first search, breadth-first search, and topological sorting.

1. DECREASE AND
CONQUER TECHNIC
BHARATI C

2. Introduction
◦Change the larger problem with smaller.
◦Solve the smaller problem.
◦Convert the smaller problem solution into larger.
◦In this method problem can be solved using top
down (recursive) solution or bottom up(iterative)
solution.
◦Each time the size of the problem reduced by
same constant on each iteration.
◦This method is also called decrease by constant.

3. Example
◦a10=a9 * a
◦an=a(n-1) * a
◦f(n) =f(n-1)*a
◦f(n)=a*(n-1)

4. Application
◦Insertion sort
◦Graph searching algorithm
◦Depth first search
◦Breadth First search.
◦Topological sorting.