My Account Log in

1 option

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

O'Reilly Online Learning: Academic/Public Library Edition Available online

View online
Format:
Book
Author/Creator:
Heineman, George T., author.
Pollice, Gary, author.
Selkow, Stanley, author.
Language:
English
Subjects (All):
Computer algorithms.
Physical Description:
1 online resource (1 volume) : illustrations
Edition:
Second edition.
Place of Publication:
Beijing, [China] : O'Reilly, 2016.
System Details:
text file
Summary:
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 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
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.
Notes:
Includes bibliographical references and index.
Description based on online resource; title from PDF title page (EBC, viewed January 23, 2018).
Includes index.
ISBN:
9781491912973
1491912979
9781491912997
1491912995
9781491948927
1491948922
OCLC:
945654266

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account