Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching: Fundamentals, Data Structures, Sorting, Searching 3rd Edition, Kindle Edition

3.6 out of 5 stars 25 customer reviews
ISBN-13: 978-0201314526
ISBN-10: 0201314525
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Kindle App Ad
Buy
$57.59
Digital List Price: $71.99

Deliver to your Kindle or other device

Rent from
Price
New from Used from
eTextbook
"Please retry"
$57.59

This month's Book With Buzz: "The Lying Game" by Ruth Ware
From the instant New York Times bestselling author of blockbuster thrillers "In a Dark, Dark Wood" and "The Woman in Cabin 10" comes Ruth Ware’s chilling new novel, "The Lying Game." See 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
  • Android

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


Editorial Reviews

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.

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.



0201314525AB06262002


Product details

  • File Size: 28112 KB
  • Print Length: 720 pages
  • Simultaneous Device Usage: Up to 5 simultaneous devices, per publisher limits
  • Publisher: Addison-Wesley Professional; 3 edition (August 22, 1997)
  • Publication Date: August 22, 1997
  • Sold by: Amazon Digital Services LLC
  • Language: English
  • ASIN: B010TQKZ2M
  • Text-to-Speech: Enabled
  • X-Ray:
  • Word Wise: Not Enabled
  • Lending: Not Enabled
  • Screen Reader: Supported
  • Enhanced Typesetting: Enabled
  • Amazon Best Sellers Rank: #630,127 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  • Would you like to tell us about a lower price?


Customer reviews

Top customer reviews

on December 28, 2015
Format: Paperback|Verified Purchase
0Comment|Was this review helpful to you?YesNoReport abuse
on July 2, 2014
Format: Paperback|Verified Purchase
0Comment| One person found this helpful. Was this review helpful to you?YesNoReport abuse
on September 7, 2016
Format: Paperback|Verified Purchase
0Comment| 2 people found this helpful. Was this review helpful to you?YesNoReport abuse
on June 8, 2017
Format: Paperback
0Comment|Was this review helpful to you?YesNoReport abuse
on November 13, 2014
Format: Paperback
0Comment|Was this review helpful to you?YesNoReport abuse
on April 15, 2000
Format: Paperback
0Comment| 8 people found this helpful. Was this review helpful to you?YesNoReport abuse

Most recent customer reviews

Set up an Amazon Giveaway

Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching: Fundamentals, Data Structures, Sorting, Searching
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching: Fundamentals, Data Structures, Sorting, Searching