Algorithms in C (paperback)

Algorithms in C (paperback)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem 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, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms.This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs.

Table of Contents:
I. 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. General Line Intersection 28. Closest-Point Problems. Closest-Pair Problem. Voronoi Diagrams. VI. GRAPH ALGORITHMS. 29. Elementary Graph Algorithms. Glossary. Representation. Depth-First Search. Nonrecursive Depth-First Search. Breadth-First Search. Mazes. Perspective. 30. Connectivity. Connected Components. Biconnectivity. Union-Find Algorithms. 31. Weighted Graphs Minimum Spanning Tree. Priority-First Search. Kruskal’s Method. Shortest Path. Minimum Spanning Tree and Shortest Paths in Dense Graphs. Geometric Problems. 32. Network Flow. The Network Flow Problem. Ford-Fulkerson Method. Network Searching. 33. Matching. Bipartite Graphs. Stable Marriage Problem. Advanced Algorithms. VII. MATHEMATICAL ALGORITHMS. 34. Random Numbers. Applications. Linear Congruential Method. Additive Congruential Method. Testing Randomness. Implementation Notes. 35. Arithmetic. Polynomial Arithmetic. Polynomial Evaluation and Interpolation. Polynomial Multiplication. Arithmetic Operations with Large Integers. Matrix Arithmetic. 36. Gaussian Elimination. A Simple Example. Outline of the Method. Variations and Extensions. 37. Curve Fitting. Polynomial Interpolation. Spline Interpolation. Method of Least Squares. 38. Integration. Symbolic Integration. Simple Quadrature Methods. Compound Methods. Adaptive Quadrature. VIII. ADVANCED TOPICS 39. Parallel Algorithms. General Approaches. Perfect Shuffles. Systolic Arrays. Perspective. 40. The Fast Fourier Transform. Evaluate, Multiply, Interpolate. Complex Roots of Unity. Evaluation of the Roots of Unity. Interpolation at the Roots of Unity. Implementation. 41. Dynamic Programming. Knapsack Problem. Matrix Chain Product. Optimal Binary Search Trees. Time and Space Requirements. 42. Linear Programming. Linear Programs. Geometric Interpretation. The Simplex Method. Implementation. 43. Exhaustive Search. Exhaustive Search in Graphs. Backtracking. Digression: Permutation Generation. Approximation Algorithms. 44. NP-Complete Problems. Deterministic and Nondeterministic Polynomial-Time Algorithms. NP-Completeness. Cook’s Theorem. Some NP-Complete Problems.


Best Sellers


Product Details
  • ISBN-13: 9780768682335
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Addison-Wesley Educational Publishers Inc
  • Edition: 1
  • Language: English
  • Returnable: Y
  • Spine Width: 40 mm
  • Width: 165 mm
  • ISBN-10: 0768682339
  • Publisher Date: 10 Jan 2008
  • Binding: Paperback
  • Height: 240 mm
  • No of Pages: 672
  • Series Title: English
  • Weight: 1027 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithms in C (paperback)
Pearson Education (US) -
Algorithms in C (paperback)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithms in C (paperback)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA