Essential Algorithms W / Ws - Couverture souple

Stephens, Rod

Couverture souple

ISBN 10 : 1118612108 ISBN 13 : 9781118612101

Editeur : John Wiley &Sons, 2013

Synopsis

A friendly and accessible introduction to the most useful algorithms

Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview.

• Reveals methods for manipulating common data structures such as arrays, linked lists, trees, and networks
• Addresses advanced data structures such as heaps, 2-3 trees, B-trees
• Addresses general problem-solving techniques such as branch and bound, divide and conquer, recursion, backtracking, heuristics, and more
• Reviews sorting and searching, network algorithms, and numerical algorithms
• Includes general problem-solving techniques such as brute force and exhaustive search, divide and conquer, backtracking, recursion, branch and bound, and more

In addition, Essential Algorithms features a companion website that includes full instructor materials to support training or higher ed adoptions.

A propos du livre

À propos de l'auteur

Rod Stephens began his career as a mathematician, but while at MIT he was lured into the intriguing world of algorithms and has been programming ever since. An award-winning instructor, he regularly addresses conferences and has written 26 books that have been translated into nearly a dozen languages.

Détails de l'édition

• Éditeur: John Wiley &Sons
• Date d'édition: 2013
• Langue: anglais
• ISBN 10: 1118612108
• ISBN 13: 9781118612101
• Reliure: Broché
• Nombre de pages: 624
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible