{"product_id":"9780321623973","title":"Algorithms in Java, Parts 1-4","description":"\u003cp\u003eThis edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.\u003c\/p\u003e \u003cp\u003eMany 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 400,000 programmers!\u003c\/p\u003e \u003cp\u003eThis particular book, \u003cb\u003e\u003ci\u003eParts 1-4\u003c\/i\u003e\u003c\/b\u003e, 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 Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.\u003c\/p\u003e \u003cp\u003e\u003cb\u003eHighlights\u003c\/b\u003e\u003c\/p\u003e \u003cul\u003e  \u003cli\u003eJava class implementations of more than 100 important practical algorithms\u003c\/li\u003e  \u003cli\u003eEmphasis on ADTs, modular programming, and object-oriented programming\u003c\/li\u003e  \u003cli\u003eExtensive coverage of arrays, linked lists, trees, and other fundamental data structures\u003c\/li\u003e  \u003cli\u003eThorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)\u003c\/li\u003e  \u003cli\u003eComplete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods\u003c\/li\u003e  \u003cli\u003eQuantitative information about the algorithms that gives you a basis for comparing them\u003c\/li\u003e  \u003cli\u003eMore than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms\u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003eWhether 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.\u003c\/p\u003e","brand":"Pearson Education","offers":[{"title":"Default Title","offer_id":46570447995121,"sku":"9780321623973","price":65.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0674\/5433\/7265\/files\/9780321623973_p0.jpg?v=1765419234","url":"https:\/\/shop.barnesandnoble.com\/products\/9780321623973","provider":"Barnes \u0026 Noble","version":"1.0","type":"link"}