|
|
|
|
| LEADER |
02027nmm a2200457 u 4500 |
| 001 |
EB001908271 |
| 003 |
EBX01000000000000001071173 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 1491948922
|
| 020 |
|
|
|a 1491912987
|
| 020 |
|
|
|a 9781491912997
|
| 020 |
|
|
|a 1491912995
|
| 020 |
|
|
|a 9781491912980
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 100 |
1 |
|
|a Heineman, George T.
|
| 245 |
0 |
0 |
|a Algorithms in a nutshell
|c George T. Heineman, Gary Pollice, & Stanley Selkow
|
| 250 |
|
|
|a Second edition
|
| 260 |
|
|
|a Sebastopol, CA
|b O'Reilly Media
|c 2016
|
| 300 |
|
|
|a 1 online resource
|b illustrations
|
| 505 |
0 |
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer algorithms / fast
|
| 653 |
|
|
|a algorithms / aat
|
| 653 |
|
|
|a Algorithmes
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Computer algorithms / http://id.loc.gov/authorities/subjects/sh91000149
|
| 653 |
|
|
|a Algorithmus / gnd / http://d-nb.info/gnd/4001183-5
|
| 700 |
1 |
|
|a Pollice, Gary
|e author
|
| 700 |
1 |
|
|a Selkow, Stanley
|e author
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 490 |
0 |
|
|a In a nutshell
|
| 776 |
|
|
|z 1491912987
|
| 776 |
|
|
|z 9781491912997
|
| 776 |
|
|
|z 9781491912980
|
| 776 |
|
|
|z 1491912995
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781491912973/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.1
|
| 520 |
|
|
|a 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--
|