Algorithms in Java : Parts 1-4, Fundamentals, data structures, sorting, searching (Record no. 6971)

010 ## - ISBN
ISBN 0201361205
200 ## - titre
titre Algorithms in Java : Parts 1-4, Fundamentals, data structures, sorting, searching
Type document Livre
auteur Robert, Sedgewick
210 ## - éditeur
lieu de publication Boston
nom de l'editeur Addison-Wesley
date de publication 2003
101 ## - langue
langue du document Anglais
langue de l'oeuvre originale Anglais
215 ## - description
Nombre de pages XIX-737 pages
606 ## - sujets
sujet Java (langage de programmation)
606 ## - sujets
sujet Algorithmes
330 ## - résumé
texte de la note This 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.<br/><br/>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 400,000 programmers!<br/><br/>This particular book, Parts 1-4 , 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.<br/><br/> Highlights<br/> Java class implementations of more than 100 important practical algorithms<br/> Emphasis on ADTs, modular programming, and object-oriented programming<br/> Extensive coverage of arrays, linked lists, trees, and other fundamental data structures<br/> Thorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)<br/> Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods<br/> Quantitative information about the algorithms that gives you a basis for comparing them<br/> More than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms<br/><br/>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.
686 ## - Classification
Classification 005.13 Langages de programmation
700 ## - auteur(s)
auteur Sedgewick
partie du nom autre que l'élément d';entrée Robert
koha internal code 4801
100 ## - données générales de traitement
données générales de traitement 20030117u u u0frey5003 b
831 ## - Informations de catalogage locales
date de modification 17/01/2003
Propriétaire Dépositaire Localisation code barre cote Statut note
ENS Rennes - Bibliothèque ENS Rennes - Bibliothèque Informatique 00007194 005.13 SED Empruntable 005.13 Langages de programmation

Powered by Koha