problem solving strategies

The most widely strategies are listed below

Divide and conquer
Binary doubling strategy
Dynamic programming

divide and conquer method

The basic idea is to divide the problem into several sub problems beyond
which cannot be further subdivided. Then solve the sub problems efficiently and
join then together to get the solution for the main problem.

binary doubling strategy?

The reverse of divide and conquer strategy, i.e. combining small problems in to
one is known as binary doubling strategy. This strategy is used to avoid the
generation of intermediate results.

dynamic programming
Dynamic programming is used when the problem is to be solved in a
sequence of intermediate steps. It is particularly relevant for many optimization
problems, i.e. frequently encountered in Operations research.

Program development steps:

1) System analysis
2) Specification and design
3) Program
4) Debug
5) Alpha test
6) Beta test
7) Deliver the program
In C