title: Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition) (Pts. 1-4)
author:  Robert Sedgewick 
description: ""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.."<br />- 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.<br />- 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
zlib_text: EATCS 
  Monographs on Theoretical Computer Science 
  Editors: 
  W. Brauer G. Rozenberg A. Salomaa 
  Advisory Board: G. Ausiello S. Even 
  M. Nivat Chr. Papadimitriou D. Scott 
  
  Kurt Mehlhorn 
  Data Structures and Algorithms 1: 
  Sorting and Searching 
  With 87 Figures 
  Springer-Verlag 
  Berlin Heidelberg New York Tokyo 1984 
  
  Editors 
  Prof. Dr. Wilfried Brauer 
  FB Informatik der UniversiHit 
  Rothenbaum-Chausee 67-69, 2000 Hamburg 13, Germany 
  Prof. Dr. Grzegorz Rozenberg 
  Institut of Applied Mathematics and Computer Science 
  University of Leiden, Wassenaarseweg 80, P. O. Box 9512 
  2300 RA Leiden, The Netherlands 
  Prof. Dr. Arto Salomaa 
  Department of Mathematics, University of Turku 
  20500 Turku 50, Finland 
  Author 
  Prof. Dr. Kurt Mehlhorn 
  FB 10, Angewandte Mathematik und Informatik 
  UniversiUit des Saarlandes, 6600 Saarbrucken, Germany 
  With the permission of B. G. Teubner publishers, Stuttgart, 
  arranged, solely authorized and revised English translation of the original 
  German edition: Effi