Algorithms

This is the eBook version of the printed book.Essential Information about Algorithms and Data StructuresA Classic ReferenceThe latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad CoverageFull treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know.Completely Revised CodeNew Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.Engages with ApplicationsAlgorithms 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.Intellectually StimulatingEngages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.A Scientific ApproachDevelops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.ContentsChapter 1: FundamentalsProgramming ModelData AbstractionBags, Stacks, and QueuesAnalysis of AlgorithmsCase Study: Union-FindChapter 2: SortingElementary SortsMergesortQuicksortPriority QueuesApplicationsChapter 3: SearchingSymbol TablesBinary Search TreesBalanced Search TreesHash TablesApplicationsChapter 4: GraphsUndirected GraphsDirected GraphsMinimum Spanning TreesShortest PathsChapter 5: StringsString SortsTriesSubstring SearchRegular ExpressionsData CompressionChapter 6: Context Read more