**What is the meaning of Top-Down and Bottom-Up approach of designing an algorithm in programming?**

**Top-Down Design approach of an Algorithm:**

*In this design approach we starts by dividing the complex algorithmic problem into one or more sub-problem or modules. These sub-problem can further be decomposed into one or more sub-problems or modules, and this process of decomposition is iterated until the desired level of module complexity is achieved. It is a form of step-wise refinement where we start with the top-most module and incrementally add modules that it calls. Therefore, in this approach, we start from an abstract design and then at each step, this design is refined into more concrete levels until a level is reached that requires no further refinement in it.*

**Bottom-Up Design approach of an Algorithm:**

*In this design approach we just do the reverse of top-down approach. In this design approach, we start with designing the most basic modules of the problem and then proceed towards designing higher level modules of the same problem. The higher level modules are implemented by using the operations performed by lower level modules. So, we can say that in this approach the sub-modules of the problem are grouped together to form a higher level module. All the higher level modules are clubbed together to form even higher level modules. This process is repeated until the design of the complete algorithm is obtained.*

**Thanks**

**Mukesh Rajput**
## No comments:

## Post a Comment

Thanks

Mukesh Rajput