See algs4.cs.princeton.edu/code. Completely Revised Code New Java implementation written in accessible style of modular programming, where all the affected code reader and ready for use. Involved with the Application The algorithms studied in the context of important scientific engineering, and commercial applications. Clients and algorithms are presented in real code, not the pseudo-code that is found in other books. Stimulating Intellectual Involve the reader interested in the text a clear, concise, detailed with a visual example, with careful code, historical and scientific context, and training at all levels. Scientific Approach Develop precise statement about its performance, supported by appropriate mathematical models and empirical studies validate the models. Integrated with the Web Visit algs4.cs.princeton.edu for the site, freely accessible Web a comprehensive, including digesting the text, code, test data, programming projects, exercises, lecture slides, and other resources. Content Chapter 1: Fundamentals Programming Model Data Abstraction Bags, Stacks, and Queues Algorithm Analysis Case Study: Union-Find Chapter 2: Sorting Primary Sort Mergesort Quicksort Queue priority Applications Chapter 3: Search Symbol Table Binary search tree Balanced Search Trees Hash Table Applications Chapter 4: Graphics Undirected graph Directed Graph Minimum spanning tree The shortest path Chapter 5: Strings Sorting Strings Try Substring Search Regular Expressions Data Compression Chapter 6: Context