 |
GetTextbooks.com
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Programming Classics: Implementing the World's Best Algorithms by Ian Oliver ISBN-10: 9780131004139 ISBN-10: 0-13-100413-1 ISBN-13: 9780131004139 ISBN-13: 978-0-13-100413-9 Textbook Binding 1994-02-17 Prentice Hall PTR Find Lowest Price |
Editorials | ||
Product Description This volume provides a catalogue of the best algorithms ever devised for a wide range of practical problems facing those who write computer programs. Less mathematical and more practical in approach than other volumes, it helps programmers save research and programming time and enables them to quickly and easily generate efficient structured code in solving such problems. Complete algorithms are provided — along with discussions of their use and an in-depth analysis of each. Provides utility algorithms as well as those useful in numbering, permuting, data structuring, sorting, searching, randomizing, bookkeeping, financing, curve fitting, file updating, evaluating, and estimating. A tool kit of solutions for all levels of computer programmers in industry and business. | ||
Reviews | ||
A catalog of good algoritms for any IT professional No higher mathematics in this book, 386 pages of logical reasoning algoritms. I have not read it cover to cover but sure is a great addition for any IT library. Contents are: 1.Introduction 2.Aritmetic(decimal, fractional and similarity) 3.Numeration (check digts, dates, roman numerals) 4.Permutation and combinations (nested loops, passwords, finding shortest route thru cities) 5.Data structures (stack array, queues,heap, free-stack-queue-double linked lists, balanced tree) 6.Sorting and merging ( sequecing, array sorting) 7.Text processing (soundex, text similarity, patters, hashing, trie) 8.Random Numbers(generators, selection) 9.Finance (statements, general legder, cash flow, loans, function root) 10.File updating (serial-indexed updates, hashing) 11.Matrices (linear, pivot, matrix root) 12.Curve fitting (polynominal, cubic spline, smoothed curve, multiple linear) 13.Networks (topological sort, critical path, spanning tree) | ||
Clear, efficient implementation/documentation Provides an accessible detail of varying complexity algorithms. Understandable pseudo code directly translateable to C/++, Java, Pascal, Turing. Source for teaching first and second year undergrad efficiency, recursion, OOP through sorting, searching, processing. Highly effective simplification of conceptual diffculties in the teaching of abstract data structures. Good long-term reference item, very effective library reserve item. | ||