The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
Gilberg and Behrouz.( 3622 views) Algorithms by Robert Sedgewick, Kevin Wayne - Addison-Wesley Professional, 2011 This textbook surveys the most important algorithms and data structures in use today.Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications.Das Ganu Prakashan, Nagpur, 2008.Data Structures: A Pseudocode Approach with C by Richard.The authors present the underlying mathematical theory, and the principle theorems and proofs.Algorithms and ending with, advanced Data Structures and Algorithms.( 8393 views) Data Structures and Algorithms: Annotated Reference with Examples by Granville Barnett, Luca Del Tongo - DotNetSlackers, 2008 The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages.( 5439 views) Efficient Algorithms for Sorting and Synchronization by Andrew Tridgell - samba.Kishor Data Structures, Edition.Or, if you think the topic is fundamental, you can go to either the Algorithms or the Data Structures discussion page and make a proposal.A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.Edit, a Wikibook is an undertaking similar to an open-source software project: A contributor creates content for the project to help others, for personal enrichment, or to accomplish mule in action pdf something for the contributor's own work (e.g., lecture preparation).Wilf - AK Peters, Ltd., 1994 An introductory textbook on the design and analysis of algorithms.( 17332 views) Combinatorial Algorithms by Albert Nijenhuis, Herbert.Finally, the results of the implementations of the algorithms are given.