Algorithms In C by Robert Sedgewick

Description: About this productProduct InformationThis new version of the best-selling book, Algorithms, Second Edition, provides a comprehensive collection of algorithms implemented in C. A variety of algorithms are described in each of the following areas: sorting, searching, string-processing, geometric, graph, and mathematical algorithms. These algorithms are expressed in terms of concise implementations in C, so that readers can both appreciate their fundamental properties and test them on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, the relationship of the practical algorithms being discussed to purely theoretical results is also described. It features hundreds of detailed, innovative figures clearly demonstrate how important algorithms work. Throughout the book, properties sections encapsulate specific information on the performance characteristics of algorithms. Six chapters present fundamental concepts, including a brief introduction to data structures. Algorithms in C provides readers with the tools to confidently implement, run, and debug useful algorithms. ThProduct IdentifiersPublisherAddison-Wesley ProfessionalISBN-100201514257ISBN-139780201514254eBay Product ID (ePID)81895Product Key FeaturesAuthorRobert SedgewickPublication NameAlgorithms in CFormatHardcoverLanguageEnglishPublication Year1990TypeTextbookNumber of Pages99998 PagesDimensionsItem Length9.5in.Item Height1.2in.Item Width6.5in.Item Weight35.3 OzAdditional Product FeaturesAbout this productProduct InformationThis new version of the best-selling book, Algorithms, Second Edition, provides a comprehensive collection of algorithms implemented in C. A variety of algorithms are described in each of the following areas: sorting, searching, string-processing, geometric, graph, and mathematical algorithms. These algorithms are expressed in terms of concise implementations in C, so that readers can both appreciate their fundamental properties and test them on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, the relationship of the practical algorithms being discussed to purely theoretical results is also described. It features hundreds of detailed, innovative figures clearly demonstrate how important algorithms work. Throughout the book, properties sections encapsulate specific information on the performance characteristics of algorithms. Six chapters present fundamental concepts, including a brief introduction to data structures. Algorithms in C provides readers with the tools to confidently implement, run, and debug useful algorithms. ThProduct IdentifiersPublisherAddison-Wesley ProfessionalISBN-100201514257ISBN-139780201514254eBay Product ID (ePID)81895Product Key FeaturesAuthorRobert SedgewickPublication NameAlgorithms in CFormatHardcoverLanguageEnglishPublication Year1990TypeTextbookNumber of Pages99998 PagesDimensionsItem Length9.5in.Item Height1.2in.Item Width6.5in.Item Weight35.3 OzAdditional Product FeaturesLc Classification NumberQa76.73.C15s43 1990Table of ContentI. FUNDAMENTALS. 1. Introduction. Algorithms. Outline of Topics. 2. C. Example: Euclid''s Algorithm. Types of Data. Input/Output. Concluding Remarks. 3. Elementary Data Structures. Arrays. Linked Lists. Storage Allocation. Pushdown Stacks. Queues. Abstract Data Types. 4. Trees. Glossary. Properties. Representing Binary Trees. Representing Forests. Traversing Trees. 5. Recursion. Recurrences. Divide-and-Conquer. Recursive Tree Traversal. Removing Recursion. Perspective. 6. Analysis of Algorithms. Framework. Classification of Algorithms. Computational Complexity. Average-Case Analysis. Approximate and Asymptotic Results. Basic Recurrences. Perspective. 7. Implementation of Algorithms. Selecting an Algorithm. Empirical Analysis. Program Optimization. Algorithms and Systems. II. SORTING ALGORITHMS. 8. Elementary Sorting Methods. Rules of the Game. Selection Sort. Insertion Sort. Digression: Bubble Sort. Performance Characteristics of Elementary Sorts. Sorting Files with Large Records. Shellsort. Distribution Counting. 9. Quicksort. The Basic Algorithm. Performance Characteristics of Quicksort. Removing Recursion. Small Subfiles. Median-of-Three Partitioning. Selection. 10. Radix Sorting. Bits. Radix Exchange Sort. Straight Radix Sort. Performance Characteristics of Radix Sorts. A Linear Sort. 11. Priority Queues. Elementary Implementations. Heap Data Structure. Algorithms on Heaps. Heapsort. Indirect Heaps. Advanced Implementations. 12. Mergesort. Merging. Mergesort. List Mergesort. Bottom-up Mergesort. Performance Characteristics. Optimized Implementations. Recursion Revisited. 13. External Sorting. Sort-Merge. Balanced Multiway Merging. Replacement Selection. Practical Considerations. Polyphase Merging. An Easier Way. III. SEARCHING ALGORITHMS. 14. Elementary Searching Methods. Sequential Searching. Binary Search. Binary Tree Search. Deletion. Indirect Binary Search Trees. 15. Balanced Trees. Top-Down 2-3-4 Trees. Red-Black Trees. Other Algorithms. 16. Hashing. Hash Functions. Separate Chaining. Linear Probing. Double Hashing. Perspective. 17. Radix Searching. Digital Search Trees. Radix Search Tries. Multiway Radix Searching. Patricia. 18. External Searching. Indexed Sequential Access. B-Trees. Extendible Hashing. Virtual Memory. IV. STRING PROCESSING. 19. String Searching. A Short History. Brute-Force Algorithm. Knuth-Morris-Pratt Algorithm. Boyer-Moore Algorithm. Rabin-Karp Algorithm. Multiple Searches. 20. Pattern Matching. Describe Patterns. Pattern Matching Machines. Representing the Machine. Simulating the Machine. 21. Parsing. Context-Free Grammars. Top-Down Parsing. Bottom-Up Parsing. Compilers. Compiler-Compilers. 22. File Compression. Run-Length Encoding. Variable-Length Encoding. Building the Huffman Code. Implementation. 23. Cryptology. Rules of Game. Simple Methods. Encryption/Decryption Machines. Public-Key Cryptosystems. V. GEOMETRIC ALGORITHMS. 24. Elementary Geometric Methods. Points, Lines, and Polygons. Line Segment Intersection. Simple Closed Path. Inclusion in a Polygon. Perspective. 25. Finding the Convex Hull. Rules of the Game. Package-Wrapping. The Graham Scan. Interior Elimination. Performance Issues. 26. Range Searching. Elementary Methods. Grid Method. Two-Dimensional Trees. Multidimensional Range Searching. 27. Geometric Intersection. Horizontal and Vertical Lines. Implementation.Copyright Date1990Target AudienceScholarly & ProfessionalTopicAlgebra / General, Programming Languages / C, Software Development & Engineering / Systems Analysis & DesignLccn89-037096Dewey Decimal005.133Dewey Edition22IllustratedYesGenreComputers, Mathematics

Price: 10.9 USD

Location: Multiple Locations

End Time: 2024-08-15T02:13:17.000Z

Shipping Cost: 3.97 USD