Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Browse By

Divide and Conquer

This dimension groups algorithms by the design technique they use, divide and conquer, dynamic programming or greedy choice. Wikipedia notes that "advanced algorithms may utilize loops and involve many conditionals that decide the next step based on the inputs provided," a structural choice that defines the technique behind the algorithm. Browsing by design technique keeps algorithms built the same way grouped together.

Facts
Comparison
Era of Emergence
1951 CE 1
Divide and Conquer
Sources
1. Wikipedia: Sorting algorithm
WikipediaSorting algorithm, History section
Quote, Sorting algorithm, History section
Among the authors of early sorting algorithms around 1951 was Betty Holberton, who worked on ENIAC and UNIVAC.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.