- Taschenbuch: 362 Seiten
- Verlag: O'Reilly and Associates; Auflage: 1 (31. Oktober 2008)
- Sprache: Englisch
- ISBN-10: 059651624X
- ISBN-13: 978-0596516246
- Größe und/oder Gewicht: 15 x 2,3 x 22,6 cm
- Durchschnittliche Kundenbewertung: 2 Kundenrezensionen
- Amazon Bestseller-Rang: Nr. 272.770 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
Algorithms in a Nutshell (Englisch) Taschenbuch – 31. Oktober 2008
Dieses Buch gibt es in einer neuen Auflage:
Kunden, die diesen Artikel gekauft haben, kauften auch
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. "Algorithms in a Nutshell" describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs - with just enough math to let you understand and analyze algorithm performance. With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.With this book, you will: solve a particular coding problem or improve on the performance of an existing solution; quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right one to use; get algorithmic solutions in C, C++, Java, and Ruby with implementation tips; learn the expected performance of an algorithm, and the conditions it needs to perform at its best; discover the impact that similar design decisions have on different algorithms; and, learn advanced data structures to improve the efficiency of algorithms.With "Algorithms in a Nutshell", you'll learn how to improve the performance of key algorithms essential for the success of your software applications.
Über den Autor und weitere Mitwirkende
George Heineman is an Associate Professor of Computer Science at WPI. His research interests are in Software Engineering. He co-edited the 2001 book "Component-Based Software Engineering: Putting the Pieces Together". He was the Program Chair for the 2005 International Symposium on Component-Based Software Engineering.Gary Pollice is a Professor of Practice at Worcester Polytechnic Institute. He made the move in 2003 to the hallowed halls of academia where he has been corrupting the minds of the next generation of software developers with radical ideas like, "learn how to work as part of a team and it's okay to be a nerd as long as you are a great one." Gary is also the co-author of Head First Object-Oriented Analysis and Design (ISBN: 9780596008673).Stanley Selkow received a BS in Electrical Engineering from Carnegie Institute of Technology in 1965, and then a Ph.D. in the same area from the University of Pennsylvania in 1970. From 1968 to 1970 he was in the Public Health Service at the National Institutes of Health at Bethesda Maryland. Since 1970 he has been on the faculty at universities in Knoxville TN and Worcester MA, as well as Montreal, Chonqing, Lausanne and Paris. His major research has been in graph theory and algorithm design.
I have a pretty good collection of books on algorithms. Many O'Reilly books are among the collection. Yet I am most impressed with" Algorithms in a Nutshell "a desktop quick reference. I won't go into a lot of detail as anybody who purchases this book was already know what they're looking for. I am impressed however that for such a small book this goes into a lot of deep concepts and gives you practical solutions.
The best way to see if this book is useful compared to others is to look at sorting algorithms that you know by heart such as median sort and quick sort. If this book tells you what you already know or even does a better job of explaining what you know this is the book for you. This is definitely the book for me.
Even with these examples, that take very little adjustment to put into the real world, you may want to supplement this book with "Sorting and Searching (The Art of Computer Programming, Volume 3)" by Donald E Knuth, Richard S Varga, and Michael A Harrison.
Even if you are not a programmer this book can help you to understand what programmers and or coders are accomplishing with their programs. For people taking any math discipline school this makes a fantastic supplement to understanding math from a different angle.
The Art of Computer Programming 3. Sorting and Searching: The Classic Work Newly Updated and Revised
Mir hat es sehr geholfen da es an den richtigen Stellen auf "Introduction to Algorithms" verweist, welches auch bei mir steht, jedoch fuer schnelles nachschlagen eher nicht geeignet ist.
Die Beispiele sind gut und ausfuehrlich, und das Buch an sich ist Praxisbezogen sowie als Nachschlagewerk aufgebaut.
Genau was man sich erwartet (ich mir erwartet habe).
Die hilfreichsten Kundenrezensionen auf Amazon.com
That's how come this book is extremely useful for algorithms consumers. It's very practical and skip most of the math b***s***. You open it, jump right to the solution you want, lookup the pseudocode and the graph, and maybe spend a few minutes to read the description, that's it. Get in, get out, get things done, people happy.
If you really care about the math, there are plenty of algorithms classic out there on the shelf you can get. But if you just need the algorithms to save you ass at some point like me, this is the perfect choice.
The code examples are mostly written in C but most programmers will be fine with using the psuedo-coded algorithms and their favorite language.
This is the ONLY book I've found so far that UNDERSTANDABLY explains algorithms without Math-Proof spam. It is actually the best algorithm reference book I've found so far. Has lots of pictures.
Well worth the money. BUY IT.
The writing style and pseudocode are relatively easy to comprehend.
Ähnliche Artikel finden