000			03567cam a22003612 b4500
001			1ssj0000493548
003			OSt
005			20150408114138.0
006			m d
007			cr n
008			980604e19980713maua s|||||||| 2|eng|d
020			_a9780201350883
020			_a0201350882 (Trade Paper) _cUSD 69.99 Retail Price (Pearson Education)
024	1		_a785342350883
024	3		_a9780201350883
035			_a(WaSeSS)ssj0000493548
037			_b01157628
040			_aMa-Un
082	0	0	_a005.12028 _221
100	1		_aSedgewick, Robert _eAuthor. _936686
240	1	0	_aAlgorithms in C++ (Online)
245	1	0	_aAlgorithms in C++ _bPts. 1-4: Fundamentals, Data Structure, Sorting, Searching.
250			_a3rd ed.,Revised.
260			_aBoston : _bAddison Wesley Professional _cJuly 1998 _aOld Tappan : _bPearson Education [Distributor]
300			_a752 p. _bill _c24 cm
506			_aAccess restricted to BGSU students, faculty and staff.
520	8		_aAnnotation _b<p style="MARGIN: 0px">Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.</p><p style="MARGIN: 0px">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!</p><p style="MARGIN: 0px">This particular book, Parts 1n4, 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. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.</p><b>Highlights</b><ul><li>Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures</li><li>Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions</li><li>Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations</li><li>New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more</li><li>Increased quantitative information about the algorithms, giving you a basis for comparing them</li><li>Over 1000 new exercises to help you learn the properties of algorithms</li></ul><p style="MARGIN: 0px">Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.</p>
521			_aScholarly & Professional _bAddison Wesley Professional.
650			_aComputational intelligence _915802
650			_aComputer science
710	2		_aSafari Technical Books. _919374
942			_2ddc _cBOOK
999			_c30479 _d264979