che-chandler.de
|
| Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt. |
Essential Algorithms
A Practical Approach to Computer Algorithms
E-Book
Nicht lieferbar | Lieferzeit: Nicht lieferbar I
Beschreibung:
A friendly and accessible introduction to the most usefulalgorithms
Computer algorithms are the basic recipes for programming.Professional programmers need to know how to use algorithms tosolve difficult programming problems. Written in simple, intuitiveEnglish, this book describes how and when to use the most practicalclassic algorithms, and even how to create new algorithms to meetfuture needs. The book also includes a collection of questions thatcan help readers prepare for a programming job interview.
* Reveals methods for manipulating common data structures such asarrays, 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 andbound, divide and conquer, recursion, backtracking, heuristics, andmore
* Reviews sorting and searching, network algorithms, andnumerical algorithms
* Includes general problem-solving techniques such as brute forceand exhaustive search, divide and conquer, backtracking, recursion,branch and bound, and more
In addition, Essential Algorithms features a companionwebsite that includes full instructor materials to support trainingor higher ed adoptions.
Computer algorithms are the basic recipes for programming.Professional programmers need to know how to use algorithms tosolve difficult programming problems. Written in simple, intuitiveEnglish, this book describes how and when to use the most practicalclassic algorithms, and even how to create new algorithms to meetfuture needs. The book also includes a collection of questions thatcan help readers prepare for a programming job interview.
* Reveals methods for manipulating common data structures such asarrays, 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 andbound, divide and conquer, recursion, backtracking, heuristics, andmore
* Reviews sorting and searching, network algorithms, andnumerical algorithms
* Includes general problem-solving techniques such as brute forceand exhaustive search, divide and conquer, backtracking, recursion,branch and bound, and more
In addition, Essential Algorithms features a companionwebsite that includes full instructor materials to support trainingor higher ed adoptions.