FREE Delivery in the UK.
In stock.
Dispatched from and sold by Amazon. Gift-wrap available.
Algorithms in C, Parts 1-... has been added to your Basket
+ £2.80 delivery
Used: Good | Details
Sold by rbmbooks
Condition: Used: Good
Comment: Used, good: average wear, reasonable shape, may have limited notes and/or highlighting. Delivered in 10-12 business days from the USA. Money-back guarantee.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching: Fundamentals, Data Structures, Sorting, Searching (3rd Edition) (Pts. Data Structures, Sorting, Searching Pts. 1-4 Paperback – 17 Sep 1997


See all 5 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
Paperback
£66.99
£60.21 £30.79
Note: This item is eligible for click and collect. Details
Pick up your parcel at a time and place that suits you.
  • Choose from over 13,000 locations across the UK
  • Prime members get unlimited deliveries at no additional cost
How to order to an Amazon Pickup Location?
  1. Find your preferred location and add it to your address book
  2. Dispatch to this address when you check out
Learn more
click to open popover

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone

To get the free app, enter your mobile phone number.



Product details

  • Paperback: 720 pages
  • Publisher: Addison-Wesley Professional; 3 edition (17 Sept. 1997)
  • Language: English
  • ISBN-10: 0201314525
  • ISBN-13: 978-0201314526
  • Product Dimensions: 19.8 x 3.8 x 23.1 cm
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: 1,257,556 in Books (See Top 100 in Books)
  • Would you like to tell us about a lower price?
    If you are a seller for this product, would you like to suggest updates through seller support?

  • See Complete Table of Contents

Product description

Synopsis

Parts 1-4 of Robert Sedgewick's work provide extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. They reflect the third edition's greater emphasis on abstract data types (ADTs). Coverage includes more than 100 key algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations. Also included are new implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, and multiway tries. Increased quantitative information gives students a more solid basis for comparing algorithms, and hundreds of new exercises reinforce their learning. Algorithms and data structures described in the book are expressed in concise implementations in C, so that students can both appreciate their fundamental properties and test them on real applications.

From the Back Cover

"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.."
- Steve Summit, author of
C Programming FAQs

Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.
- William A. Ward, University of South Alabama

Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers!

This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.

Highlights
  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs) than in previous editions
  • Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
  • New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
  • Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms

Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

See all Product description


Customer reviews

There are no customer reviews yet.
Share your thoughts with other customers

Most helpful customer reviews on Amazon.com

Amazon.com: 3.7 out of 5 stars 19 reviews
Jjeff
5.0 out of 5 starsWorth 10 stars for the algorithms it explains
28 December 2015 - Published on Amazon.com
Verified Purchase
Roger
5.0 out of 5 starsGoood
3 July 2014 - Published on Amazon.com
Verified Purchase
One person found this helpful.
Susan
3.0 out of 5 starsIt must not be easy to write a book talking about the algorithms
7 September 2016 - Published on Amazon.com
Verified Purchase
2 people found this helpful.
Amazon Customer
5.0 out of 5 starsA Classic on Algorithms...
27 June 2007 - Published on Amazon.com
2 people found this helpful.
Sam Oakford
2.0 out of 5 starsSedgeWork
20 June 2006 - Published on Amazon.com
9 people found this helpful.

Where's My Stuff?

Delivery and Returns

Need Help?