In computer science, decomposition , also known as factoring , refers to the process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program, and maintain.

In structured programming, algorithmic decomposition breaks a process down into well-defined steps.

object-oriented programming decomposition , on the other hand, breaks a large system down into progressively smaller classes or objects that are responsible for some part of the problem domain.

According to Grady Booch, algorithmic decomposition is a necessary part of object-oriented analysis and design, but object-oriented systems start with and emphasize decomposition into classes. (Booch, 1994, pp.16-20)

=References=

=See Also=

=External links=