Matters Computational: Ideas, Algorithms, Source Code
by Joerg Arndt
2010
Number of pages: 972
Description:
This is a book for the computationalist, whether a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. We use the C++ programming language for low-level algorithms.
Download or read it online for free here:
Download link
(multiple formats)
Similar books
Clever Algorithms: Nature-Inspired Programming Recipes
by Jason Brownlee - GitHub
This book provides a handbook of algorithmic recipes from the fields of Metaheuristics, Biologically Inspired Computation and Computational Intelligence that have been described in a complete, consistent, and centralized manner.
(18640 views)
by Jason Brownlee - GitHub
This book provides a handbook of algorithmic recipes from the fields of Metaheuristics, Biologically Inspired Computation and Computational Intelligence that have been described in a complete, consistent, and centralized manner.
(18640 views)
Sequential and Parallel Sorting Algorithms
by H. W. Lang - FH Flensburg
From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest. Explanations are followed by source code.
(21502 views)
by H. W. Lang - FH Flensburg
From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest. Explanations are followed by source code.
(21502 views)
Text Algorithms
by M. Crochemore, W. Rytter - Oxford University Press
This book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It will serve both as a textbook for courses on algorithm design and as a reference for professionals.
(18073 views)
by M. Crochemore, W. Rytter - Oxford University Press
This book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It will serve both as a textbook for courses on algorithm design and as a reference for professionals.
(18073 views)
Algorithms Notes for Professionals
- Goalkicker.com
Contents: Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
(7601 views)
- Goalkicker.com
Contents: Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
(7601 views)