Procedural programming: Difference between revisions

Content added Content deleted

Inline

Revision as of 02:32, 21 July 2008

Procedural programming describes a way of decomposing a programming problem, when a larger problem is decomposed into smaller ones by means of subprograms. This type of decomposition is called procedural. It is typical for imperative programming and functional programming paradigms.

In object-oriented programming procedural decomposition plays a subordinate role. Subprograms become methods of objects, which replace the former as building blocks.

Historically, procedural programming played a decisive role in the creation of programming solutions to engineering problems.

Revision as of 02:31, 21 July 2008 (view source) rosettacode>Mwn3d m (Removed unverifiable statement, re-fix English) ← Older edit		Revision as of 02:32, 21 July 2008 (view source) MikeMol (talk \| contribs) m (added a comma) Newer edit →
Line 3:		Line 3:
	In [[object-oriented programming]] procedural decomposition plays a subordinate role. Subprograms become methods of objects, which replace the former as building blocks.		In [[object-oriented programming]] procedural decomposition plays a subordinate role. Subprograms become methods of objects, which replace the former as building blocks.

	Historically procedural programming played a decisive role in the creation of programming solutions to engineering problems.		Historically, procedural programming played a decisive role in the creation of programming solutions to engineering problems.