<< 1 >>
Rating: 
Summary: A catalog of good algoritms for any IT professional
Review: 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)
Rating: 
Summary: Clear, efficient implementation/documentation
Review: Provides an accessible detail of varying complexity algorithms. Understandable pseudo code directlytranslateable 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.
<< 1 >>
|
