✦ LIBER ✦

Algorithms + data structures=programs

✍ Scribed by Niklaus Wirth

Book ID: 127454225
Publisher: Prentice-Hall
Year: 1976
Tongue: English
Weight: 3 MB
Series: Prentice-Hall series in automatic computation
Edition: 1st
Category: Library
City: Englewood Cliffs, N.J
ISBN: 0130224189

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genetic Algorithms + Data Structures = E

Genetic Algorithms + Data Structures = Evolution Programs

✍ Zbigniew Michalewicz 📂 Library 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 5 MB

Zbigniew Michalewicz's Genetic Algorithms + Data Structures = Evolution Programs has three sections. The first section is a straightforward introduction to genetic algorithms. In the second section, Michalewicz describes how to apply genetic algorithms to numerical optimization. Michalewicz, who is

Data Structures and Algorithms

✍ Wirth, Niklaus 📂 Article 📅 1984 🏛 Nature Publishing Group 🌐 English ⚖ 747 KB

Algorithms and Data Structures

✍ Niklaus Wirth 📂 Library 🌐 English ⚖ 1 MB

Data structures and network algorithms

✍ Robert Endre Tarjan 📂 Library 📅 1987 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1 MB

The first half of the book covers the data structures used in solving the network problems that are presented in the second half. These data structures including disjoint sets, heaps, and search trees. Highlights of this half of the book are Tarjan's proof of the amoritized cost of union find, and e

Data Structures & Algorithms in Java

✍ Mitchell Waite, Robert Lafore 📂 Library 📅 1998 🏛 Waite Group Press 🌐 English ⚖ 3 MB

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs, c

Data structures and network algorithms

✍ Robert Endre Tarjan 📂 Library 📅 1987 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1 MB

There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in networ