| Description |
1 online resource (xxxviii, 762 pages) |
| Contents |
Algorithm basics -- Numerical algorithms -- Linked lists -- Arrays -- Stacks and queues -- Sorting -- Searching -- Recursion -- Trees -- Balanced trees -- Decision trees -- Basic network algorithms -- More network algorithms -- String algorithms -- Cryptography -- Complexity theory-- Distributed algorithms -- Interview puzzles |
| Summary |
The revised and updated second edition of Essential Algorithms, offers an accessible introduction to computer algorithms. The book contains a description of important classical algorithms and explains when each is appropriate. The author shows how to analyze algorithms in order to understand their behavior and teaches techniques that the can be used to create new algorithms to meet future needs. The text includes useful algorithms such as: methods for manipulating common data structures, advanced data structures, network algorithms, and numerical algorithms. It also offers a variety of general problem-solving techniques. -- Provided by publisher |
| Notes |
Includes index |
|
Online resource; title from PDF title page (EBSCO, viewed June 4, 2019) |
| Subject |
Computer algorithms.
|
|
Python (Computer program language)
|
|
C# (Computer program language)
|
|
Algorithms.
|
|
algorithms.
|
|
COMPUTERS -- Programming -- Algorithms.
|
|
Algorithms
|
|
C# (Computer program language)
|
|
Computer algorithms
|
|
Python (Computer program language)
|
|
Computers and IT.
|
| Form |
Electronic book
|
| ISBN |
9781119575955 |
|
1119575958 |
|
1119575982 |
|
9781119575986 |
|
9781119575962 |
|
1119575966 |
|
