Beginning algorithms:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Indianapolis, IN
Wiley
2006
|
| Series: | Programmer to programmer
|
| Subjects: | |
| Online Access: | Table of contents only Publisher description Contributor biographical information Inhaltsverzeichnis |
| Item Description: | Literaturverz. S. [488] - [493] Includes bibliographical references and index |
| Physical Description: | XXVI, 564 S. Ill., graph Darst. 24 cm |
| ISBN: | 0764596748 9780764596742 |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV022496351 | ||
| 003 | DE-604 | ||
| 005 | 20070712 | ||
| 007 | t | ||
| 008 | 070705s2006 xxua||| |||| 00||| eng d | ||
| 010 | |a 2005022374 | ||
| 020 | |a 0764596748 |9 0-7645-9674-8 | ||
| 020 | |a 9780764596742 |9 978-0-7645-9674-2 | ||
| 035 | |a (OCoLC)61204410 | ||
| 035 | |a (DE-599)BVBBV022496351 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-573 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Harris, Simon |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Beginning algorithms |c Simon Harris and James Ross |
| 264 | 1 | |a Indianapolis, IN |b Wiley |c 2006 | |
| 300 | |a XXVI, 564 S. |b Ill., graph Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Programmer to programmer | |
| 500 | |a Literaturverz. S. [488] - [493] | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Ross, James |e Sonstige |4 oth | |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/ecip0517/2005022374.html |3 Table of contents only | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0622/2005022374-d.html |3 Publisher description | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0654/2005022374-b.html |3 Contributor biographical information | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015703479&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015703479 | ||
Record in the Search Index
| _version_ | 1804136593525571584 |
|---|---|
| adam_text | CONTENTS ACKNOWLEDGMENTS IX INTRODUCTION XIX CHAPTER 1: GETTING STARTED
1 DEFINING ALGORITHMS 1 UNDERSTANDING COMPLEXITY IN RELATION TO
ALGORITHMS 3 UNDERSTANDING BIG-0 NOTATION 4 CONSTANT TIME: 0(1) 6 LINEAR
TIME: 0(N) 6 QUADRATIC TIME: 0(N 2 ) 6 LOGARITHMIC TIME: 0(LOG N) AND
0(N LOG N) 8 FACTORIAL TIME: 0(N!) 8 UNIT TESTING 9 WHAT IS UNIT
TESTING? 9 WHY UNIT TESTING IS IMPORTANT 11 AJUNIT PRIMER 11 TEST-DRIVEN
DEVELOPMENT 14 SUMMARY 14 CHAPTER 2: ITERATION AND RECURSION 15
PERFORMING CALCULATIONS 16 PROCESSING ARRAYS 18 USING ITERATORS TO
OVERCOME ARRAY-BASED PROBLEMS 18 ITERATOR OPERATIONS 19 THE ITERATOR
INTERFACE 20 THE ITERABLE INTERFACE 20 ITERATOR IDIOMS 21 STANDARD
ITERATORS 21 RECURSION 35 RECURSIVE DIRECTORY TREE PRINTER EXAMPLE 37
ANATOMY OF A RECURSIVE ALGORITHM 40 THE BASE CASE 40 THE GENERAL CASE 41
SUMMARY 41 EXERCISES 41 CONTENTS CHAPTER 3: LISTS ^ AN ARRAY LIST A
LINKED LIST SUMMARY EXERCISES QUEUE OPERATIONS EXERCISES TESTING
UNDO/REDO SUMMARY COMPARATOR OPERATIONS 43 46 UNDERSTANDING LISTS
TESTING LISTS CO IMPLEMENTING LISTS OOE 59 66 74 74 CHAPTER 4: QUEUES ^5
UNDERSTANDING QUEUES 75 76 THE QUEUE INTERFACE A FIRST-IN-FIRST-OUT
QUEUE 77 IMPLEMENTING THE FIFO QUEUE 81 BLOCKING QUEUES 8 2 EXAMPLE: A
CALL CENTER SIMULATOR 8 6 RUNNING THE APPLICATION 95 SUMMARY 9 6 96
CHAPTER 5: STACKS ^Z STACKS 9 7 THE TESTS IMPLEMENTATION 1 0 2
EXAMPLE: IMPLEMENTING UNDO/REDO 1 0 5 106 114 CHAPTER 6: BASIC SORTING
. UJ5 THE IMPORTANCE OF SORTING 1 1 5 SORTING FUNDAMENTALS 1 1 6
UNDERSTANDING COMPARATORS 1 1 6 117 THE COMPARATOR INTERFACE 117 SOME
STANDARD COMPARATORS 117 WORKING WITH THE NATURAL COMPARATOR 117 WORKING
WITH THE REVERSE COMPARATOR 119 UNDERSTANDING BUBBLE SORT 121 XII
CONTENTS THE LISTSORTER INTERFACE 124 TESTING ABSTRACTLISTSORTER 124
WORKING WITH A SELECTION SORT 128 UNDERSTANDING INSERTION SORT 133
UNDERSTANDING STABILITY 138 COMPARING THE BASIC SORTING ALGORITHMS 139
CALLCOUNTINGLISTCOMPARATOR 139 LISTSORTERCALLCOUNTINGTEST 140
UNDERSTANDING THE ALGORITHM COMPARISON 143 SUMMARY 144 EXERCISES 144
CHAPTER 7: ADVANCED SORTING 145 UNDERSTANDING THE SHELLSORT ALGORITHM
145 UNDERSTANDING QUICKSORT 151 UNDERSTANDING THE COMPOUND COMPARATOR
AND STABILITY 157 UNDERSTANDING THE MERGESORT ALGORITHM 160 MERGING 160
THE MERGESORT ALGORITHM 162 COMPARING THE ADVANCED SORTING ALGORITHMS
169 SUMMARY 172 EXERCISES 172 CHAPTER 8: PRIORITY QUEUES 173
UNDERSTANDING PRIORITY QUEUES 174 A SIMPLE PRIORITY QUEUE EXAMPLE 174
WORKING WITH PRIORITY QUEUES 179 UNDERSTANDING THE UNSORTED LIST
PRIORITY QUEUE 182 UNDERSTANDING THE SORTED LIST PRIORITY QUEUE 184
UNDERSTANDING HEAP-ORDERED PRIORITY QUEUES 186 SINK OR SWIM 188
COMPARING THE PRIORITY QUEUE IMPLEMENTATIONS 194 SUMMARY 198 EXERCISES
198 CHAPTER 9: BINARY SEARCHING AND INSERTION 199 UNDERSTANDING BINARY
SEARCHING 199 BINARY SEARCH APPROACHES 202 A LIST SEARCHER 202 RECURSIVE
BINARY SEARCHER 205 XIII CONTENTS ITERATIVE BINARY SEARCHER 208
ASSESSING THE LIST SEARCHER S PERFORMANCE 210 LINEAR SEARCHING FOR
COMPARISON 210 TESTS FOR PERFORMANCE 212 UNDERSTANDING BINARY INSERTION
216 A LIST INSERTER 217 ASSESSING PERFORMANCE 220 SUMMARY 224 CHAPTER
10: BINARY SEARCH TREES 225 UNDERSTANDING BINARY SEARCH TREES 226
MINIMUM 227 MAXIMUM 227 SUCCESSOR 227 PREDECESSOR 227 SEARCH 228
INSERTION 230 DELETION 232 IN-ORDER TRAVERSAL 235 PRE-ORDER TRAVERSAL
235 POST-ORDER TRAVERSAL 235 BALANCING 236 TESTING AND IMPLEMENTING A
BINARY SEARCH TREE 238 ASSESSING BINARY SEARCH TREE PERFORMANCE 261
SUMMARY 264 EXERCISES 264 CHAPTER 11: HASHING 265 UNDERSTANDING HASHING
265 WORKING WITH HASHING 272 LINEAR PROBING 275 BUCKETING 281 ASSESSING
PERFORMANCE 285 SUMMARY 291 EXERCISES 292 CHAPTER 12: SETS . 293
UNDERSTANDING SETS 293 TESTING SET IMPLEMENTATIONS 297 XIV CONTENTS A
LIST SET 303 A HASH SET 305 A TREE SET 309 SUMMARY 315 EXERCISES 316
CHAPTER 13: MAPS 317 UNDERSTANDING MAPS 317 TESTING MAP IMPLEMENTATIONS
322 A LIST MAP 329 A HASH MAP 333 A TREE MAP 337 SUMMARY 343 EXERCISES
344 CHAPTER 14: TERNARY SEARCH TREES 345 UNDERSTANDING TERNARY SEARCH
TREES 345 SEARCHING FOR A WORD 346 INSERTING A WORD 350 PREFIX SEARCHING
351 PATTERN MATCHING 353 PUTTING TERNARY SEARCH TREES INTO PRACTICE 357
CROSSWORD HELPER EXAMPLE 370 SUMMARY 374 EXERCISE 374 CHAPTER 15:
B-TREES 375 UNDERSTANDING B-TREES 375 PUTTING B-TREES INTO PRACTICE 381
SUMMARY 392 EXERCISES 393 CHAPTER 16: STRING SEARCHING 395 A GENERIC
STRING SEARCHER INTERFACE 395 A GENERIC TEST SUITE 397 A BRUTE-FORCE
ALGORITHM 400 THE BOYER-MOORE ALGORITHM 402 CREATING THE TESTS 404
IMPLEMENTING THE ALGORITHM 404 XV CONTENTS 408 A STRING MATCH ITERATOR
4 0 9 COMPARING THE PERFORMANCE 40Q MEASURING PERFORMANCE 413 HOW THEY
COMPARE 4 ^2 SUMMARY 415 HHAPTER 17: STRING MATCHING * 415
UNDERSTANDING SOUNDEX 4 2 6 UNDERSTANDING LEVENSHTEIN WORD DISTANCE
4 3 G SUMMARY 437 NHAPTER 18: HNMPUTATJNNAL GEOMETRV . U 437 A QUICK
GEOMETRY REFRESHER 437 COORDINATES AND POINTS 43G LINES 439 TRIANGLES
440 FINDING THE INTERSECTION OF TWO LINES SLOPE 442 CROSSING THE Y AXIS
4 4 3 FINDING THE INTERSECTION POINT 4 5 7 FINDING THE CLOSEST PAIR
OF POINTS 4 6 ? SUMMARY 4 6 7 EXERCISES 469 NHAPTER 19: PRAGMATIC
OPTIMIZATION * . ^ X . 4 6 9 WHERE OPTIMIZATION FITS IN 4 7 0
UNDERSTANDING PROFILING 4 7 1 THE FILESORTINGHELPER EXAMPLE PROGRAM
475 PROFILING WITH HPROF 477 PROFILING WITH JMP 4 7 9 UNDERSTANDING
OPTIMIZATION 4 G 0 PUTTING OPTIMIZATION INTO PRACTICE 4G7 SUMMARY 489
APPENDIX A FURTHER READING 491 APPENDIX B: RESOURCES XVI CONTENTS
APPENDIX C: BIBLIOGRAPHY 493 APPENDIX D: ANSWERS TO EXERCISES 495 INDEX
541
|
| adam_txt |
CONTENTS ACKNOWLEDGMENTS IX INTRODUCTION XIX CHAPTER 1: GETTING STARTED
1 DEFINING ALGORITHMS 1 UNDERSTANDING COMPLEXITY IN RELATION TO
ALGORITHMS 3 UNDERSTANDING BIG-0 NOTATION 4 CONSTANT TIME: 0(1) 6 LINEAR
TIME: 0(N) 6 QUADRATIC TIME: 0(N 2 ) 6 LOGARITHMIC TIME: 0(LOG N) AND
0(N LOG N) 8 FACTORIAL TIME: 0(N!) 8 UNIT TESTING 9 WHAT IS UNIT
TESTING? 9 WHY UNIT TESTING IS IMPORTANT 11 AJUNIT PRIMER 11 TEST-DRIVEN
DEVELOPMENT 14 SUMMARY 14 CHAPTER 2: ITERATION AND RECURSION 15
PERFORMING CALCULATIONS 16 PROCESSING ARRAYS 18 USING ITERATORS TO
OVERCOME ARRAY-BASED PROBLEMS 18 ITERATOR OPERATIONS 19 THE ITERATOR
INTERFACE 20 THE ITERABLE INTERFACE 20 ITERATOR IDIOMS 21 STANDARD
ITERATORS 21 RECURSION 35 RECURSIVE DIRECTORY TREE PRINTER EXAMPLE 37
ANATOMY OF A RECURSIVE ALGORITHM 40 THE BASE CASE 40 THE GENERAL CASE 41
SUMMARY 41 EXERCISES 41 CONTENTS CHAPTER 3: LISTS ^ AN ARRAY LIST A
LINKED LIST SUMMARY EXERCISES QUEUE OPERATIONS EXERCISES TESTING
UNDO/REDO SUMMARY COMPARATOR OPERATIONS 43 46 UNDERSTANDING LISTS
TESTING LISTS CO IMPLEMENTING LISTS OOE 59 66 74 74 CHAPTER 4: QUEUES ^5
UNDERSTANDING QUEUES 75 76 THE QUEUE INTERFACE ' ' A FIRST-IN-FIRST-OUT
QUEUE 77 IMPLEMENTING THE FIFO QUEUE 81 BLOCKING QUEUES 8 2 EXAMPLE: A
CALL CENTER SIMULATOR 8 6 RUNNING THE APPLICATION 95 SUMMARY 9 6 96
CHAPTER 5: STACKS ^Z STACKS 9 7 THE TESTS " IMPLEMENTATION 1 0 2
EXAMPLE: IMPLEMENTING UNDO/REDO 1 0 5 106 114 CHAPTER 6: BASIC SORTING
. UJ5 THE IMPORTANCE OF SORTING 1 1 5 SORTING FUNDAMENTALS 1 1 6
UNDERSTANDING COMPARATORS 1 1 6 117 THE COMPARATOR INTERFACE 117 SOME
STANDARD COMPARATORS 117 WORKING WITH THE NATURAL COMPARATOR 117 WORKING
WITH THE REVERSE COMPARATOR 119 UNDERSTANDING BUBBLE SORT 121 XII
CONTENTS THE LISTSORTER INTERFACE 124 TESTING ABSTRACTLISTSORTER 124
WORKING WITH A SELECTION SORT 128 UNDERSTANDING INSERTION SORT 133
UNDERSTANDING STABILITY 138 COMPARING THE BASIC SORTING ALGORITHMS 139
CALLCOUNTINGLISTCOMPARATOR 139 LISTSORTERCALLCOUNTINGTEST 140
UNDERSTANDING THE ALGORITHM COMPARISON 143 SUMMARY 144 EXERCISES 144
CHAPTER 7: ADVANCED SORTING 145 UNDERSTANDING THE SHELLSORT ALGORITHM
145 UNDERSTANDING QUICKSORT 151 UNDERSTANDING THE COMPOUND COMPARATOR
AND STABILITY 157 UNDERSTANDING THE MERGESORT ALGORITHM 160 MERGING 160
THE MERGESORT ALGORITHM 162 COMPARING THE ADVANCED SORTING ALGORITHMS
169 SUMMARY 172 EXERCISES 172 CHAPTER 8: PRIORITY QUEUES 173
UNDERSTANDING PRIORITY QUEUES 174 A SIMPLE PRIORITY QUEUE EXAMPLE 174
WORKING WITH PRIORITY QUEUES 179 UNDERSTANDING THE UNSORTED LIST
PRIORITY QUEUE 182 UNDERSTANDING THE SORTED LIST PRIORITY QUEUE 184
UNDERSTANDING HEAP-ORDERED PRIORITY QUEUES 186 SINK OR SWIM 188
COMPARING THE PRIORITY QUEUE IMPLEMENTATIONS 194 SUMMARY 198 EXERCISES
198 CHAPTER 9: BINARY SEARCHING AND INSERTION 199 UNDERSTANDING BINARY
SEARCHING 199 BINARY SEARCH APPROACHES 202 A LIST SEARCHER 202 RECURSIVE
BINARY SEARCHER 205 XIII CONTENTS ITERATIVE BINARY SEARCHER 208
ASSESSING THE LIST SEARCHER'S PERFORMANCE 210 LINEAR SEARCHING FOR
COMPARISON 210 TESTS FOR PERFORMANCE 212 UNDERSTANDING BINARY INSERTION
216 A LIST INSERTER 217 ASSESSING PERFORMANCE 220 SUMMARY 224 CHAPTER
10: BINARY SEARCH TREES 225 UNDERSTANDING BINARY SEARCH TREES 226
MINIMUM 227 MAXIMUM 227 SUCCESSOR 227 PREDECESSOR 227 SEARCH 228
INSERTION 230 DELETION 232 IN-ORDER TRAVERSAL 235 PRE-ORDER TRAVERSAL
235 POST-ORDER TRAVERSAL 235 BALANCING 236 TESTING AND IMPLEMENTING A
BINARY SEARCH TREE 238 ASSESSING BINARY SEARCH TREE PERFORMANCE 261
SUMMARY 264 EXERCISES 264 CHAPTER 11: HASHING 265 UNDERSTANDING HASHING
265 WORKING WITH HASHING 272 LINEAR PROBING 275 BUCKETING 281 ASSESSING
PERFORMANCE 285 SUMMARY 291 EXERCISES 292 CHAPTER 12: SETS . 293
UNDERSTANDING SETS 293 TESTING SET IMPLEMENTATIONS 297 XIV CONTENTS A
LIST SET 303 A HASH SET 305 A TREE SET 309 SUMMARY 315 EXERCISES 316
CHAPTER 13: MAPS 317 UNDERSTANDING MAPS 317 TESTING MAP IMPLEMENTATIONS
322 A LIST MAP 329 A HASH MAP 333 A TREE MAP 337 SUMMARY 343 EXERCISES
344 CHAPTER 14: TERNARY SEARCH TREES 345 UNDERSTANDING TERNARY SEARCH
TREES 345 SEARCHING FOR A WORD 346 INSERTING A WORD 350 PREFIX SEARCHING
351 PATTERN MATCHING 353 PUTTING TERNARY SEARCH TREES INTO PRACTICE 357
CROSSWORD HELPER EXAMPLE 370 SUMMARY 374 EXERCISE 374 CHAPTER 15:
B-TREES 375 UNDERSTANDING B-TREES 375 PUTTING B-TREES INTO PRACTICE 381
SUMMARY 392 EXERCISES 393 CHAPTER 16: STRING SEARCHING 395 A GENERIC
STRING SEARCHER INTERFACE 395 A GENERIC TEST SUITE 397 A BRUTE-FORCE
ALGORITHM 400 THE BOYER-MOORE ALGORITHM 402 CREATING THE TESTS 404
IMPLEMENTING THE ALGORITHM 404 XV CONTENTS 408 A STRING MATCH ITERATOR
4 0 9 COMPARING THE PERFORMANCE 40Q MEASURING PERFORMANCE 413 HOW THEY
COMPARE 4 ^2 SUMMARY 415 HHAPTER 17: STRING MATCHING * 415
UNDERSTANDING SOUNDEX 4 2 6 UNDERSTANDING LEVENSHTEIN WORD DISTANCE
4 3 G SUMMARY 437 NHAPTER 18: HNMPUTATJNNAL GEOMETRV . U 437 A QUICK
GEOMETRY REFRESHER 437 COORDINATES AND POINTS 43G LINES 439 TRIANGLES
440 FINDING THE INTERSECTION OF TWO LINES SLOPE 442 CROSSING THE Y AXIS
4 4 3 FINDING THE INTERSECTION POINT 4 5 7 FINDING THE CLOSEST PAIR
OF POINTS 4 6 ? SUMMARY 4 6 7 EXERCISES 469 NHAPTER 19: PRAGMATIC
OPTIMIZATION * . ^ X . 4 6 9 WHERE OPTIMIZATION FITS IN 4 7 0
UNDERSTANDING PROFILING 4 7 1 THE FILESORTINGHELPER EXAMPLE PROGRAM
475 PROFILING WITH HPROF 477 PROFILING WITH JMP 4 7 9 UNDERSTANDING
OPTIMIZATION 4 G 0 PUTTING OPTIMIZATION INTO PRACTICE 4G7 SUMMARY 489
APPENDIX A" FURTHER READING 491 APPENDIX B: RESOURCES XVI CONTENTS
APPENDIX C: BIBLIOGRAPHY 493 APPENDIX D: ANSWERS TO EXERCISES 495 INDEX
541 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Harris, Simon |
| author_facet | Harris, Simon |
| author_role | aut |
| author_sort | Harris, Simon |
| author_variant | s h sh |
| building | Verbundindex |
| bvnumber | BV022496351 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)61204410 (DE-599)BVBBV022496351 |
| 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 |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01833nam a2200469zc 4500</leader><controlfield tag="001">BV022496351</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070712 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070705s2006 xxua||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2005022374</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0764596748</subfield><subfield code="9">0-7645-9674-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780764596742</subfield><subfield code="9">978-0-7645-9674-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)61204410</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022496351</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harris, Simon</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Beginning algorithms</subfield><subfield code="c">Simon Harris and James Ross</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Indianapolis, IN</subfield><subfield code="b">Wiley</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXVI, 564 S.</subfield><subfield code="b">Ill., graph Darst.</subfield><subfield code="c">24 cm</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Programmer to programmer</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [488] - [493]</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</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="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="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ross, James</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip0517/2005022374.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0622/2005022374-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0654/2005022374-b.html</subfield><subfield code="3">Contributor biographical information</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=015703479&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015703479</subfield></datafield></record></collection> |
| id | DE-604.BV022496351 |
| illustrated | Illustrated |
| index_date | 2024-07-02T17:53:36Z |
| indexdate | 2024-07-09T20:58:52Z |
| institution | BVB |
| isbn | 0764596748 9780764596742 |
| language | English |
| lccn | 2005022374 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015703479 |
| oclc_num | 61204410 |
| open_access_boolean | |
| owner | DE-573 |
| owner_facet | DE-573 |
| physical | XXVI, 564 S. Ill., graph Darst. 24 cm |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Wiley |
| record_format | marc |
| series2 | Programmer to programmer |
| spelling | Harris, Simon Verfasser aut Beginning algorithms Simon Harris and James Ross Indianapolis, IN Wiley 2006 XXVI, 564 S. Ill., graph Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Programmer to programmer Literaturverz. S. [488] - [493] Includes bibliographical references and index Computer algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Ross, James Sonstige oth http://www.loc.gov/catdir/toc/ecip0517/2005022374.html Table of contents only http://www.loc.gov/catdir/enhancements/fy0622/2005022374-d.html Publisher description http://www.loc.gov/catdir/enhancements/fy0654/2005022374-b.html Contributor biographical information GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015703479&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Harris, Simon Beginning algorithms Computer algorithms Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 |
| title | Beginning algorithms |
| title_auth | Beginning algorithms |
| title_exact_search | Beginning algorithms |
| title_exact_search_txtP | Beginning algorithms |
| title_full | Beginning algorithms Simon Harris and James Ross |
| title_fullStr | Beginning algorithms Simon Harris and James Ross |
| title_full_unstemmed | Beginning algorithms Simon Harris and James Ross |
| title_short | Beginning algorithms |
| title_sort | beginning algorithms |
| topic | Computer algorithms Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Computer algorithms Algorithmus |
| url | http://www.loc.gov/catdir/toc/ecip0517/2005022374.html http://www.loc.gov/catdir/enhancements/fy0622/2005022374-d.html http://www.loc.gov/catdir/enhancements/fy0654/2005022374-b.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015703479&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT harrissimon beginningalgorithms AT rossjames beginningalgorithms |