• Algorithms in a Nutshell See large image

    Algorithms in a Nutshell (In a Nutshell (O'Reilly)) (Paperback) By (author) George T. Heineman, By (author) Gary Pollice, By (author) Stanley Selkow

    $32.86 - Save $19.85 37% off - RRP $52.71 Free delivery worldwide Available
    Dispatched in 4 business days
    When will my order arrive?
    Add to basket | Add to wishlist |

    DescriptionCreating 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 * 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.


Other books

Other people who viewed this bought | Other books in this category
Showing items 1 to 10 of 10

 

Reviews | Bibliographic data
  • Full bibliographic data for Algorithms in a Nutshell

    Title
    Algorithms in a Nutshell
    Authors and contributors
    By (author) George T. Heineman, By (author) Gary Pollice, By (author) Stanley Selkow
    Physical properties
    Format: Paperback
    Number of pages: 364
    Width: 152 mm
    Height: 229 mm
    Thickness: 19 mm
    Weight: 488 g
    Language
    English
    ISBN
    ISBN 13: 9780596516246
    ISBN 10: 059651624X
    Classifications

    BIC E4L: COM
    Nielsen BookScan Product Class 3: S10.2
    B&T Book Type: NF
    B&T Modifier: Region of Publication: 01
    B&T Modifier: Subject Development: 20
    B&T Modifier: Academic Level: 01
    B&T Modifier: Continuations: 02
    Warengruppen-Systematik des deutschen Buchhandels: 16320
    LC classification: QA
    BIC subject category V2: UMZ
    B&T Modifier: Text Format: 01
    B&T General Subject: 227
    DC22: 005.1
    B&T Approval Code: A93603600
    B&T Merchandise Category: COM
    Abridged Dewey: 005
    Ingram Subject Code: XL
    BISAC V2.8: COM051230, COM051300
    Thema V1.0: UMZ
    Illustrations note
    black & white illustrations
    Publisher
    O'Reilly Media, Inc, USA
    Imprint name
    O'Reilly Media, Inc, USA
    Publication date
    01 November 2008
    Publication City/Country
    Sebastopol
    Author Information
    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.
    Review quote
    "Der Leser erhält eine kurze Einführung zu jedem Algorithmus, Hinweise zu geeigneten Einsatzgebieten, Implementierungsbeispiele in verschiedenen Programmiersprachen (C, C++, Ruby und Java) sowie Benchmarks, die die Performance-Entwicklung abhängig von der Art der Eingabedaten und ihrer Menge beleuchten. Abgerundet wird jede Beschreibung durch ein Fact Sheet, bei der man auf einen Blick die Performance-Entwicklung im besten, normalen und schlechtesten Fall ablesen kann, die Implementierung in Pseudo-Code sowie ein Beispiel. Dies macht das Buch zu einem wertvollen Werkzeug für jeden Programmierer, der mindestens ab und zu selber einmal einen Algorithmus in seine Software integrieren muss." - InfoWeek.ch, März 2009