Home›Technique›FieldBrowse ByFieldFactsFieldSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1946 CE 1FieldFilter Results11 entriesConcept KindAllAlgorithm Design Strategies (2)Compiler and Language Implementation Techniques (1)Concurrency and Distributed Systems Techniques (3)Cryptographic Techniques (2)Software Design Patterns (1)Software Engineering Practices (1)Origin EraAll1952 (2)1956 (1)1959 (3)1960 (2)1965 (2)1976 (2)1978 (1)1981 (1)1985 (1)1987 (1)1988 (1)1990 (1)1991 (2)1993 (1)1994 (1)1997 (1)1999 (1)2000 (1)2001 (1)2002 (1)Invented ByAllCharles Rackoff (1)David Karger (1)Edsger W. Dijkstra (1)Grace Hopper (1)Gregory Chaitin (1)John McCarthy (1)Martin Fowler (1)Martin Hellman (1)Robert C. Martin (1)Robin Milner (1)Ron Rivest (1)Shafi Goldwasser (1)Silvio Micali (1)Whitfield Diffie (2)Origin YearAll1936 (2)1956 (2)1960 (1)1965 (1)1968 (1)1969 (1)1972 (1)1976 (1)1982 (1)Show ResultsBrowseCompareAlgorithms and Complexity TheoryField10 entriesArtificial IntelligenceField1 entryComputer NetworkingField1 entryCryptographyField9 entriesDatabasesField1 entryDistributed ComputingField5 entriesInformation SecurityField1 entryOperating SystemsField3 entriesProgramming Language TheoryField7 entriesSoftware EngineeringField29 entriesTheory of ComputationField1 entrySources1. Wikipedia: Divide-and-conquer algorithmtier 2WikipediaDivide-and-conquer algorithm, History sectionQuote, Divide-and-conquer algorithm, History sectionWhile a clear description of the algorithm on computers appeared in 1946 in an article by John Mauchly, the idea of using a sorted list of items to facilitate searching dates back at least as far as Babylonia in 200 BC.View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.