Syndetics cover image
Image from Syndetics

Algorithms in a nutshell / George T. Heineman, Gary Pollice & Stanley Selkow.

By: Contributor(s): Material type: TextTextSeries: In a nutshell (O'Reilly & Associates)Publisher: Beijing ; Boston : O'Reilly, 2016Edition: Second editionDescription: xi, 373 pages : illustrations ; 23 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9781491948927 :
  • 1491948922
Subject(s):
Contents:
Thinking in algorithms -- The mathematics of algorithms -- Algorithm building blocks -- Sorting algorithms -- Searching -- Graph algorithms -- Path finding in AI -- Network flow algorithms -- Computational geometry -- Spatial tree structures -- Emerging algorithm categories -- Principles of algorithms -- Benchmarking.
Summary: 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.
Holdings
Item type Home library Collection Call number Materials specified Status Date due Barcode Item holds
Adult Book Adult Book Main Library NonFiction 005.1 H468 Checked out 06/22/2024 33111008397438
Total holds: 0

Enhanced descriptions from Syndetics:

Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of 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 Python 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

Includes bibliographical references and index.

Thinking in algorithms -- The mathematics of algorithms -- Algorithm building blocks -- Sorting algorithms -- Searching -- Graph algorithms -- Path finding in AI -- Network flow algorithms -- Computational geometry -- Spatial tree structures -- Emerging algorithm categories -- Principles of algorithms -- Benchmarking.

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.

Powered by Koha