<B> <P style="MARGIN: 0px">Essential Information about Algorithms and Data Structures</P> <P style="MARGIN: 0px"></B> </P><I> <P style="MARGIN: 0px">A Classic Reference</P> <P style="MARGIN: 0px"></I>The latest version of Sedgewick's best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. </P> <P style="MARGIN: 0px"> </P><I> <P style="MARGIN: 0px">Broad Coverage</P> <P style="MARGIN: 0px"></I>Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See .</P> <P style="MARGIN: 0px"> </P><I> <P style="MARGIN: 0px">Completely Revised Code</P> <P style="MARGIN: 0px"></I>New Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.</P> <P style="MARGIN: 0px"> </P><I> <P style="MARGIN: 0px">Engages with Applications</P> <P style="MARGIN: 0px"></I>Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.</P> <P style="MARGIN: 0px"> </P><I> <P style="MARGIN: 0px">Intellectually Stimulating</P> <P style="MARGIN: 0px"></I>Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.</P> <P style="MARGIN: 0px"> </P><I> <P style="MARGIN: 0px">A Scientific Approach</P> <P style="MARGIN: 0px"></I>Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.</P> <P style="MARGIN: 0px"> </P><I> <P style="MARGIN: 0px">Integrated with the Web</P> <P style="MARGIN: 0px"></I>Visit for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.</P> <P style="MARGIN: 0px"> </P> <P style="MARGIN: 0px"><B>Contents</B></P> <P style="MARGIN: 0px">Chapter 1: Fundamentals</P> <P style="MARGIN: 0px">Programming Model</P> <P style="MARGIN: 0px">Data Abstraction</P> <P style="MARGIN: 0px">Bags, Stacks, and Queues</P> <P style="MARGIN: 0px">Analysis of Algorithms</P> <P style="MARGIN: 0px">Case Study: Union-Find</P> <P style="MARGIN: 0px"> </P> <P style="MARGIN: 0px">Chapter 2: Sorting</P> <P style="MARGIN: 0px">Elementary Sorts</P> <P style="MARGIN: 0px">Mergesort</P> <P style="MARGIN: 0px">Quicksort</P> <P style="MARGIN: 0px">Priority Queues</P> <P style="MARGIN: 0px">Applications</P> <P style="MARGIN: 0px"> </P> <P style="MARGIN: 0px">Chapter 3: Searching</P> <P style="MARGIN: 0px">Symbol Tables</P> <P style="MARGIN: 0px">Binary Search Trees</P> <P style="MARGIN: 0px">Balanced Search Trees</P> <P style="MARGIN: 0px">Hash Tables</P> <P style="MARGIN: 0px">Applications</P> <P style="MARGIN: 0px"> </P> <P style="MARGIN: 0px">Chapter 4: Graphs</P> <P style="MARGIN: 0px">Undirected Graphs</P> <P style="MARGIN: 0px">Directed Graphs</P> <P style="MARGIN: 0px">Minimum Spanning Trees</P> <P style="MARGIN: 0px">Shortest Paths</P> <P style="MARGIN: 0px"> </P> <P style="MARGIN: 0px">Chapter 5: Strings</P> <P style="MARGIN: 0px">String Sorts</P> <P style="MARGIN: 0px">Tries</P> <P style="MARGIN: 0px">Substring Search</P> <P style="MARGIN: 0px">Regular Expressions</P> <P style="MARGIN: 0px">Data Compression</P> <P style="MARGIN: 0px"> </P> <P style="MARGIN: 0px">Chapter 6: Context</P>