الگوریتم‌ها (سری انتشارات ادیسون-وِسلی در علوم کامپیوتر)

This book is intended to survey the most important algorithms in use on computers today and to teach fundamental techniques to the growing number of people who are interested in becoming serious computer users. It is appropriate for use as a textbook for a second, third or fourth course in computer science: after students have acquired some programming skills and familiarity with computer systems, but before they have specialized courses in advanced areas of computer science or computer applications. Additionally, the book may be useful as a reference for those who already have some familiarity with the material, since it contains a number of computer implementations of useful algorithms. 1. Preview -- [section 1] Mathematical Algorithms -- 2. Arithmetic -- 3. Random Numbers -- 4. Polynomials -- 5. Gaussian Elimination -- 6. Curve Fitting -- 7. Integration -- [section 2] Sorting -- 8. Elementary Sorting Methods -- 9. Quicksort -- 10. Radix Sorting -- 11. Priority Queues -- 12. Selection And Merging -- 13. External Sorting -- [section 3] Searching -- 14. Elementary Searching Methods -- 15. Balanced Trees -- 16. Hashing -- 17. Radix Searching -- 18. External Searching -- [section 4] String Processing -- 19. String Searching -- 20. Pattern Matching -- 21. Parsing -- 22. File Compression -- 23. Cryptology -- [section 5] Geometric Algorithms -- 24. Elementary Geometric Methods -- 25. Finding The Convex Hull -- 26. Range Searching -- 27. Geometric Intersection -- 28. Closest Point Problems -- [section 6] Graph Algorithms -- 29. Elementary Graph Algorithms -- 30. Connectivity -- 31. Weighted Graphs -- 32. Directed Graphs -- 33. Network Flow -- 34. Matching -- [section 7] Advanced Topics -- 35. Algorithm Machines -- 36. The Fast Fourier Transform -- 37. Dynamic Programming -- 38. Linear Programming -- 39. Exhaustive Search -- 40. Np-complete Problems. Robert Sedgewick. Includes Bibliographies And Index.