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 ★
Comum · Literatura
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
Martin Odersky
Cientista da computação alemão
Nº Q847990 ★
Sem ofertas
-
Free Pascal
Nº Q210295 ★★
Sem ofertas
-
S
System programming language
Class of computer programming languages
Nº Q4117397 ★
Sem ofertas
-
A
Alan Turing: The Enigma
Nº Q34308373 ★★
Sem ofertas
-
I
Introdução aos Algoritmos
Nº Q1141518 ★★
Sem ofertas
-
Tarjan's strongly connected components algorithm
Graph theory algorithm
Nº Q1972285 ★
Sem ofertas
-
K
Kosaraju's algorithm
Algorithm to find the strongly connected component of a directed graph
Nº Q2655281 ★
Sem ofertas
-
A
Algoritmo de Markov
Nº Q1900936 ★★
Sem ofertas
-
C
COMAL
Linguagem de programação
Nº Q1023991 ★
Sem ofertas
-
A
Algoritmo de busca de expressões Boyer-Moore
Nº Q895984 ★
Sem ofertas
-
Pohlig–Hellman algorithm
Algorithm for computing discrete logarithms
Nº Q1755812 ★
Sem ofertas
-
D
Dhrystone
Computer performance test
Nº Q1207761 ★
Sem ofertas
-
T
Teoria algorítmica da informação
Nº Q1757543 ★
Sem ofertas
-
Suffix automaton
Minimal DFA accepting set of all suffixes of particular string
Nº Q19599738 ★
Sem ofertas
-
ALGOL
Linguagem de programação
Nº Q188436 ★★★
Sem ofertas
-
Brainfuck
Linguagem de programação esotérica
Nº Q244627 ★★★
Sem ofertas
-
Object Pascal
Linguagem de programação
Nº Q633894 ★★
Sem ofertas
-
History of software
Description of the evolution and development of software throughout history
Nº Q17155144 ★
Sem ofertas