Algorithms in a nutshell:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Beijing ; Boston ; Farnham ; Sebastopol ; Tokyo
O'Reilly
March 2016
|
| Ausgabe: | Second edition |
| Schlagwörter: | |
| Links: | https://ebookcentral.proquest.com/lib/hm-bib/detail.action?docID=4543953 https://ebookcentral.proquest.com/lib/uniregensburg-ebooks/detail.action?docID=4543953 http://proquest.tech.safaribooksonline.de/9781491912973 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029376464&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | 1 Online-Ressource (xi, 373 Seiten) Illustrationen |
| ISBN: | 9781491912997 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043967875 | ||
| 003 | DE-604 | ||
| 005 | 20241008 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161219s2016 xx a||| o|||| 00||| eng d | ||
| 020 | |a 9781491912997 |c Online |9 978-1-4919-1299-7 | ||
| 035 | |a (ZDB-32-STB)ocn945654266 | ||
| 035 | |a (OCoLC)945654266 | ||
| 035 | |a (DE-599)BVBBV043967875 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 |a DE-M347 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 100 | 1 | |a Heineman, George T. |e Verfasser |0 (DE-588)173476759 |4 aut | |
| 245 | 1 | 0 | |a Algorithms in a nutshell |c George T. Heineman, Gary Pollice & Stanley Selkow |
| 250 | |a Second edition | ||
| 264 | 1 | |a Beijing ; Boston ; Farnham ; Sebastopol ; Tokyo |b O'Reilly |c March 2016 | |
| 300 | |a 1 Online-Ressource (xi, 373 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Pollice, Gary |e Verfasser |4 aut | |
| 700 | 1 | |a Selkow, Stanley |d 1944- |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-4919-4892-7 |
| 856 | 4 | 0 | |u http://proquest.tech.safaribooksonline.de/9781491912973 |x Aggregator |z URL des Erstveröffentlichers |3 Volltext |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029376464&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ZDB-32-STB | ||
| 912 | |a ZDB-30-PQE | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-029376464 | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/hm-bib/detail.action?docID=4543953 |l DE-M347 |p ZDB-30-PQE |q FHM_Einzelkauf |x Aggregator |3 Volltext | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/uniregensburg-ebooks/detail.action?docID=4543953 |l DE-355 |p ZDB-30-PQE |q UBR Sammelbestellung 2021 |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1819367084782518272 |
|---|---|
| adam_text | Titel: Algorithms in a nutshell
Autor: Heineman, George T
Jahr: 2016
Table of Contents
Preface to the Second Edition...........................................vii
1. Thinking in Algorithms.............................................. 1
Understand the Problem 1
Naive Solution 3
Intelligent Approaches 3
Summary 8
References 8
2. The Mathematics of Algorithms.......................................9
Size of a Problem Instance 9
Rate of Growth of Functions 10
Analysis in the Best, Average, and Worst Cases 14
Performance Families 18
Benchmark Operations 31
References 33
3. Algorithm Building Blocks.......................................... 35
Algorithm Template Format 35
Pseudocode Template Format 36
Empirical Evaluation Format 37
Floating-Point Computation 38
Example Algorithm 42
Common Approaches 46
References 52
4. Sorting Algorithms................................................ 53
Transposition Sorting 57
Selection Sort 61
Heap Sort 62
Partition-Based Sorting 67
Sorting without Comparisons 74
Bucket Sort 74
Sorting with Extra Storage 81
String Benchmark Results 85
Analysis Techniques 87
References 89
5. Searching........................................................ 91
Sequential Search 92
Binary Search 95
Hash-Based Search 99
Bloom Filter 114
Binary Search Tree 119
References 131
6. Graph Algorithms................................................ 133
Graphs 134
Depth-First Search 137
Breadth-First Search 143
Single-Source Shortest Path 147
Dijkstras Algorithm for Dense Graphs 152
Comparing Single-Source Shortest-Path Options 157
All-Pairs Shortest Path 159
Minimum Spanning Tree Algorithms 163
Final Thoughts on Graphs 167
References 168
7. Path Finding in AI................................................ 169
Game Trees 169
Path-Finding Concepts 173
Minimax 174
NegMax 180
AlphaBeta 183
Search Trees 189
Depth-First Search 192
Breadth-First Search 198
A*Search 201
Comparing Search-Tree Algorithms 211
References 214
Table of Contents
8. Network Flow Algorithms......................................... 217
Network Flow 218
Maximum Flow 220
Bipartite Matching 2 31
Reflections on Augmenting Paths 234
Minimum Cost Flow 238
Transshipment 239
Transportation 240
Assignment 242
Linear Programming 242
References 243
9. Computational Geometry..........................................245
Classifying Problems 246
Convex Hull 249
Convex Hull Scan 250
Computing Line-Segment Intersections 258
LineSweep 259
Voronoi Diagram 268
References 281
10. Spatial Tree Structures............................................ 283
Nearest Neighbor Queries 284
Range Queries 285
Intersection Queries 285
Spatial Tree Structures 285
Nearest Neighbor Queries 288
Range Query 298
Quadtrees 305
R-Trees 311
References 323
11. Emerging Algorithm Categories.................................... 325
Variations on a Theme 325
Approximation Algorithms 326
Parallel Algorithms 332
Probabilistic Algorithms 336
References 344
12. Epilogue: Principles of Algorithms.................................. 345
Know Your Data 345
Decompose a Problem into Smaller Problems 346
Table of Contents | v
Choose the Right Data Structure 347
Make the Space versus Time Trade-Off 349
Construct a Search 350
Reduce Your Problem to Another Problem 350
Writing Algorithms Is Hard-Testing Algorithms Is Harder 351
Accept Approximate Solutions When Possible 352
Add Parallelism to Increase Performance 353
A. Benchmarking................................................... 355
Index.............................................................. 367
Table of Contents
|
| any_adam_object | 1 |
| author | Heineman, George T. Pollice, Gary Selkow, Stanley 1944- |
| author_GND | (DE-588)173476759 |
| author_facet | Heineman, George T. Pollice, Gary Selkow, Stanley 1944- |
| author_role | aut aut aut |
| author_sort | Heineman, George T. |
| author_variant | g t h gt gth g p gp s s ss |
| building | Verbundindex |
| bvnumber | BV043967875 |
| collection | ZDB-32-STB ZDB-30-PQE |
| ctrlnum | (ZDB-32-STB)ocn945654266 (OCoLC)945654266 (DE-599)BVBBV043967875 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02278nam a2200481zc 4500</leader><controlfield tag="001">BV043967875</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241008 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161219s2016 xx a||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781491912997</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4919-1299-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-32-STB)ocn945654266</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)945654266</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043967875</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-M347</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heineman, George T.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173476759</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms in a nutshell</subfield><subfield code="c">George T. Heineman, Gary Pollice & Stanley Selkow</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Beijing ; Boston ; Farnham ; Sebastopol ; Tokyo</subfield><subfield code="b">O'Reilly</subfield><subfield code="c">March 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 373 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pollice, Gary</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Selkow, Stanley</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-4919-4892-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://proquest.tech.safaribooksonline.de/9781491912973</subfield><subfield code="x">Aggregator</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029376464&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-32-STB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029376464</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/hm-bib/detail.action?docID=4543953</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">FHM_Einzelkauf</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/uniregensburg-ebooks/detail.action?docID=4543953</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">UBR Sammelbestellung 2021</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV043967875 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T17:50:03Z |
| institution | BVB |
| isbn | 9781491912997 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029376464 |
| oclc_num | 945654266 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR DE-M347 |
| owner_facet | DE-355 DE-BY-UBR DE-M347 |
| physical | 1 Online-Ressource (xi, 373 Seiten) Illustrationen |
| psigel | ZDB-32-STB ZDB-30-PQE ZDB-30-PQE FHM_Einzelkauf ZDB-30-PQE UBR Sammelbestellung 2021 |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | O'Reilly |
| record_format | marc |
| spellingShingle | Heineman, George T. Pollice, Gary Selkow, Stanley 1944- Algorithms in a nutshell Computer algorithms Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4151278-9 |
| title | Algorithms in a nutshell |
| title_auth | Algorithms in a nutshell |
| title_exact_search | Algorithms in a nutshell |
| title_full | Algorithms in a nutshell George T. Heineman, Gary Pollice & Stanley Selkow |
| title_fullStr | Algorithms in a nutshell George T. Heineman, Gary Pollice & Stanley Selkow |
| title_full_unstemmed | Algorithms in a nutshell George T. Heineman, Gary Pollice & Stanley Selkow |
| title_short | Algorithms in a nutshell |
| title_sort | algorithms in a nutshell |
| topic | Computer algorithms Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Computer algorithms Algorithmus Einführung |
| url | http://proquest.tech.safaribooksonline.de/9781491912973 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029376464&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT heinemangeorget algorithmsinanutshell AT pollicegary algorithmsinanutshell AT selkowstanley algorithmsinanutshell |
Online lesen (HM)