Content deleted Content added
m Citation parameter fixes, , title using AWB (7751) |
→Recursion in computer science: No need for non-free image here; we could use a free page, so this doesn't satisfy WP:NFCC |
||
Line 101:
==Recursion in computer science==
{{Main|Recursion (computer science)}}
A common method of simplification is to divide a problem into subproblems of the same type. As a [[computer programming]] technique, this is called [[divide and conquer algorithm|divide and conquer]] and is key to the design of many important algorithms. Divide and conquer serves as a top-down approach to problem solving, where problems are solved by solving smaller and smaller instances. A contrary approach is [[dynamic programming]]. This approach serves as a bottom-up approach, where problems are solved by solving larger and larger instances, until the desired size is reached.
| |||