Algorithms + Data Structures = Programs
Non-fiction work by Niklaus Wirth
Algorithms + Data Structures = Programs is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of system engineering, computer programming, particularly that algorithms and data structures are inherently related. For example, if one has a sorted list one will use a search algorithm optimal for sorted lists.
Nº Q4724373 ★
Common · Literature
Algorithms + Data Structures = Programs
Non-fiction work by Niklaus Wirth
Algorithms + Data Structures = Programs is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of system engineering, computer programming, particularly that algorithms and data structures are inherently related. For example, if one has a sorted list one will use a search algorithm optimal for sorted lists.
From Wikipedia
Algorithms + Data Structures = Programs is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of system engineering, computer programming, particularly that algorithms and data structures are inherently related. For example, if one has a sorted list one will use a search algorithm optimal for sorted lists. The book is one of the most influential computer science books of its time and, like Wirth's other work, has been used extensively in education. The Turbo Pascal compiler written by Anders Hejlsberg was largely inspired by the Tiny Pascal compiler in Niklaus Wirth's book.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Martin Odersky
German computer scientist, inventor of Scala programming language
Nº Q847990 ★
Not listed
-
Free Pascal
Free compiler for Pascal and ObjectPascal
Nº Q210295 ★★
Not listed
-
S
System programming language
Class of computer programming languages
Nº Q4117397 ★
Not listed
-
A
Alan Turing: The Enigma
Biography by Andrew Hodges
Nº Q34308373 ★★
Not listed
-
I
Introduction to Algorithms
Book on computer programming
Nº Q1141518 ★★
Not listed
-
Tarjan's strongly connected components algorithm
Graph theory algorithm
Nº Q1972285 ★
Not listed
-
K
Kosaraju's algorithm
Algorithm to find the strongly connected component of a directed graph
Nº Q2655281 ★
Not listed
-
M
Markov algorithm
String rewriting system that uses grammar-like rules to operate on strings of symbols
Nº Q1900936 ★★
Not listed
-
C
COMAL
Programming language
Nº Q1023991 ★
Not listed
-
B
Boyer–Moore string-search algorithm
String searching algorithm
Nº Q895984 ★
Not listed
-
Pohlig–Hellman algorithm
Algorithm for computing discrete logarithms
Nº Q1755812 ★
Not listed
-
D
Dhrystone
Computer performance test
Nº Q1207761 ★
Not listed
-
A
Algorithmic information theory
Subfield of information theory and computer science
Nº Q1757543 ★
Not listed
-
Suffix automaton
Minimal DFA accepting set of all suffixes of particular string
Nº Q19599738 ★
Not listed
-
ALGOL
Family of imperative computer programming languages
Nº Q188436 ★★★
Not listed
-
Brainfuck
Esoteric, minimalist programming language
Nº Q244627 ★★★
Not listed
-
Object Pascal
Branch of object-oriented derivatives of Pascal programming language
Nº Q633894 ★★
Not listed
-
History of software
Description of the evolution and development of software throughout history
Nº Q17155144 ★
Not listed