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)
Springer, Date: 2012. Softcover. Brand New. International Edition - ISBN number and front cover may be different in rare cases but CONTENTS are same as the US edition. No shipping to PO BOX, APO, FPO addresses. Kindly provide day time phone number in order to ensure smooth delivery. Printed in black & white in English language. Territorial restrictions may be printed on the book. We may ship from Asian regions for inventory purpose. 100% Customer satisfaction guaranteed!" We use Fast Shipping via DHL/FEDEX/UPS 2012. Springer ISBN 3540779779 9783540779773 [US]
Springer, Date: 2008-06-23. Hardcover. Good. 0.7874 in x 9.4488 in x 6.2992 in. 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. 2008. Springer ISBN 3540779779 9783540779773 [US]
Springer. Softcover. Brand New. International Edition - ISBN number and front cover may be different, but CONTENTS are same as the US edition. We ship fast via USPS/FedEx/DHL/Aramex Express Services. No shipping to PO BOX, APO, FPO addresses. Kindly provide day time phone number in order to ensure smooth delivery. Printed in black & white in English language. Territorial restrictions may be printed on the book. We may ship from Asian regions for inventory purpose. 100% Customer satisfaction guaranteed!" We use Fast Shipping via DHL/FEDEX/UPS Springer ISBN 3540779779 9783540779773 [US]
ISBN10: 3540779779, ISBN13: 9783540779773, [publisher: Springer] Hardcover Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. [Berlin, Germany] [Publication Year: 2008]
ISBN10: 3540779779, ISBN13: 9783540779773, [publisher: Springer] Hardcover Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. [Berlin, Germany] [Publication Year: 2008]
ISBN10: 3540779779, ISBN13: 9783540779773, [publisher: Springer] Hardcover New Book. Shipped from UK. Established seller since 2000. [Fairford, GLOS, United Kingdom] [Publication Year: 2008]
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] Hardcover New Book. Shipped from UK. Established seller since 2000. [Wood Dale, IL, U.S.A.] [Publication Year: 2008]
Springer 6/23/2008 12: 00: 00 AM 2008 Hardcover New Book from multilingual publisher. Shipped from UK within 4 to 14 days. Please check language within the description.
Springer 6/23/2008 12: 00: 00 AM 2008 Hardcover PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book from multilingual publisher. Shipped from UK within 4 to 14 days. Please check language within the description.
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 6/23/2008 12: 00: 00 AM 2008 Hardcover PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book from multilingual publisher. Shipped from UK within 4 to 14 days. Please check language within the description.
Springer-Verlag New York Inc, Date: 2008. Hardcover. New. 1st edition. 300 pages. 9.50x6.25x1.00 inches. 2008. Springer-Verlag New York Inc ISBN 3540779779 9783540779773 [GB]
Hard Cover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Algorithms and Data Structures : The Basic Toolbox. ISBN 3540779779 9783540779773 [GB]
Hardback. New. This concise introduction is ideal for readers familiar with programming and basic mathematical language. It uses pictures, words and high-level pseudocode to explain algorithms and presents efficient implementations using real programming languages. ISBN 3540779779 9783540779773 [GB]
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. [Zwiesel, Germany] [Publication Year: 2008]
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. 300 pp. Englisch [Köln, NRW, Germany] [Publication Year: 2008]
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 ...
description size:
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.