+Algorithm for Programmers by Jorg Arndt
The latest 23 chapters so far:
- Bit wizardry
- Permutations
- Sorting and searching
- Data structures
- Combinatorial algorithms
- Searching paths in directed graphs
- The Fourier transform
- Algorithms for fast convolution
- The Hartley transform (HT)
- Number theoretic transforms (NTTs)
- The Walsh transform and its relatives
- The Haar transform
- and 10 chapters on arithmetical algorithms
# Paperback: 192 pages
# Publisher: Prentice Hall; 1st edition (February 8, 1995)
# Language: English
# ISBN-10: 0134335589
# ISBN-13: 978-0134335582
# Product Dimensions: 9.2 x 7 x 0.5 inches
# Shipping Weight: 10.4 ounces
Description
With approximately 600 problems and 35 worked examples, this supplement provides a collection of practical problems on the design, analysis and verification of algorithms. The book focuses on the important areas of algorithm design and analysis: background material; algorithm design techniques; advanced data structures and NP-completeness; and miscellaneous problems. Algorithms are expressed in Pascal-like pseudo code supported by figures, diagrams, hints, solutions, and comments.
No comments:
Post a Comment