DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
×
The link of the search results:
Please copy and share (some browsers may have copied to Clipboard)
ISBN10: 3540779779, ISBN13: 9783540779773, [publisher: Springer-Verlag Gmbh Jun 2008] Hardcover Neuware - Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java.The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal ...
ISBN10: 3540779779, ISBN13: 9783540779773, [publisher: Springer-Verlag Gmbh Jun 2008] Hardcover Neuware - Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java.The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal ...
Springer 2008 2008 ed. Hardcover Good Used books may not include access codes or one time use codes. Proven Seller with Excellent Customer Service. Choose expedited shipping and get it FAST.
ISBN10: 3540779779, ISBN13: 9783540779773, [publisher: Springer] Hardcover Used books may not include access codes or one time use codes. Proven Seller with Excellent Customer Service. Choose expedited shipping and get it FAST. [Conway, AR, U.S.A.] [Publication Year: 2008]
description size:
showing per page
DISCLOSURE: When you use one of our links to make a purchase, we may earn a commission at no extra cost to you. As an Amazon Associate, AddALL earn commission from qualifying Amazon purchases.