000			02171nam a2200253Ia 4500
003			NULRC
005			20250520100608.0
008			250520s9999 xx 000 0 und d
020			_a9780321573513
040			_cNULRC
050			_aQA 76.9.A43 .S43 2011
100			_aSedgewick, Robert _eauthor
245		0	_aAlgorithms / _cRobert Sedgewick and Kevin Wayne.
250			_aFourth edition.
260			_aUpper Saddle River, New Jersey : _bAddision-Wesley Publishing Company, _cc2011
300			_axii, 955 pages : _billustrations ; _c24 cm.
365			_bUSD58.98
504			_aIncludes bibliographical references and index.
505			_aChapter 1: Fundamentals 1.1 Programming Model 1.2 Data Abstraction 1.3 Queues, Stacks, and Bags 1.4 Analysis of Algorithms 1.5 Case Study: Union-Find Chapter 2: Sorting 2.1 Elementary Sorts 2.1 Elementary Sorts 2.2 Mergesort 2.3 Quicksort 2.4 Priority Queues 2.5 Applications Chapter 3: Searching 3.1 Symbol Tables 3.1 Symbol Tables 3.2 Binary Search Trees 3.3 Balanced Search Trees 3.4 Hash Tables 3.5 Applications Chapter 4: Graphs 4.1 Undirected graphs 4.1 Undirected graphs 4.2 Directed graphs 4.3 Minimum Spanning Trees 4.4 Shortest Paths Chapter 5: Strings 5.1 String Sorts 5.1 String Sorts 5.2 Tries 5.3 Substring Search 5.4 Regular Expressions 5.5 Data Compression Context Systems Programming Systems Programming Scientific Computing Commercial Applications Operations Research Intractability Index
520			_aThis fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing--including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.
650			_aCOMPUTER ALGORITHMS -- TEXTBOOKS
700			_aWayne, Kevin _eco-author
942			_2lcc _cBK
999			_c9005 _d9005