Learning algorithms: a programmer's guide to writing better code
When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple l...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Sebastopol, CA
O'Reilly Media, Inc.
2021
|
| Edition: | First edition. |
| Subjects: | |
| Links: | https://learning.oreilly.com/library/view/-/9781492091059/?ar |
| Summary: | When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively. Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem, simulating the experience you might find in a technical code interview. With this book, you will: Examine fundamental algorithms central to computer science and software engineeringLearn common strategies for efficient problem solving, such as divide and conquer, dynamic programming, and greedy approaches; Analyze code to evaluate time complexity using big O notation; Use existing Python libraries and data structures to solve problems using algorithms; Understand the main steps of important algorithms. |
| Item Description: | Includes index. - Description based on online resource; title from digital title page (viewed on October 6, 2021) |
| Physical Description: | 1 Online-Ressource (xiii, 263 Seiten) illustrations |
| ISBN: | 9781492091035 1492091030 |
Staff View
MARC
| LEADER | 00000cam a22000002c 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-059851198 | ||
| 003 | DE-627-1 | ||
| 005 | 20240228121411.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201119s2021 xx |||||o 00| ||eng c | ||
| 020 | |a 9781492091035 |c electronic bk. |9 978-1-4920-9103-5 | ||
| 020 | |a 1492091030 |c electronic bk. |9 1-4920-9103-0 | ||
| 035 | |a (DE-627-1)059851198 | ||
| 035 | |a (DE-599)KEP059851198 | ||
| 035 | |a (ORHE)9781492091059 | ||
| 035 | |a (DE-627-1)059851198 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 082 | 0 | |a 005.13 |2 23 | |
| 100 | 1 | |a Heineman, George T. |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Learning algorithms |b a programmer's guide to writing better code |c George T. Heineman |
| 250 | |a First edition. | ||
| 264 | 1 | |a Sebastopol, CA |b O'Reilly Media, Inc. |c 2021 | |
| 264 | 4 | |c ©2021 | |
| 300 | |a 1 Online-Ressource (xiii, 263 Seiten) |b illustrations | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Includes index. - Description based on online resource; title from digital title page (viewed on October 6, 2021) | ||
| 520 | |a When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively. Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem, simulating the experience you might find in a technical code interview. With this book, you will: Examine fundamental algorithms central to computer science and software engineeringLearn common strategies for efficient problem solving, such as divide and conquer, dynamic programming, and greedy approaches; Analyze code to evaluate time complexity using big O notation; Use existing Python libraries and data structures to solve problems using algorithms; Understand the main steps of important algorithms. | ||
| 650 | 0 | |a Computer algorithms | |
| 650 | 0 | |a Computer programming | |
| 650 | 2 | |a Algorithms | |
| 650 | 4 | |a Algorithmes | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 4 | |a algorithms | |
| 650 | 4 | |a computer programming | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Computer programming | |
| 776 | 1 | |z 1492091065 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 1492091065 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781492091059/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Record in the Search Index
| DE-BY-TUM_katkey | ZDB-30-ORH-059851198 |
|---|---|
| _version_ | 1829007748810932224 |
| adam_text | |
| any_adam_object | |
| author | Heineman, George T. |
| author_facet | Heineman, George T. |
| author_role | aut |
| author_sort | Heineman, George T. |
| author_variant | g t h gt gth |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)059851198 (DE-599)KEP059851198 (ORHE)9781492091059 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | First edition. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02982cam a22005052c 4500</leader><controlfield tag="001">ZDB-30-ORH-059851198</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20240228121411.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201119s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781492091035</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-4920-9103-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1492091030</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-4920-9103-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)059851198</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP059851198</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781492091059</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)059851198</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heineman, George T.</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Learning algorithms</subfield><subfield code="b">a programmer's guide to writing better code</subfield><subfield code="c">George T. Heineman</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">First edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Sebastopol, CA</subfield><subfield code="b">O'Reilly Media, Inc.</subfield><subfield code="c">2021</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 263 Seiten)</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index. - Description based on online resource; title from digital title page (viewed on October 6, 2021)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively. Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem, simulating the experience you might find in a technical code interview. With this book, you will: Examine fundamental algorithms central to computer science and software engineeringLearn common strategies for efficient problem solving, such as divide and conquer, dynamic programming, and greedy approaches; Analyze code to evaluate time complexity using big O notation; Use existing Python libraries and data structures to solve problems using algorithms; Understand the main steps of important algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">1492091065</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">1492091065</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781492091059/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-059851198 |
| illustrated | Illustrated |
| indexdate | 2025-04-10T09:35:14Z |
| institution | BVB |
| isbn | 9781492091035 1492091030 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xiii, 263 Seiten) illustrations |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | O'Reilly Media, Inc. |
| record_format | marc |
| spelling | Heineman, George T. VerfasserIn aut Learning algorithms a programmer's guide to writing better code George T. Heineman First edition. Sebastopol, CA O'Reilly Media, Inc. 2021 ©2021 1 Online-Ressource (xiii, 263 Seiten) illustrations Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Includes index. - Description based on online resource; title from digital title page (viewed on October 6, 2021) When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively. Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem, simulating the experience you might find in a technical code interview. With this book, you will: Examine fundamental algorithms central to computer science and software engineeringLearn common strategies for efficient problem solving, such as divide and conquer, dynamic programming, and greedy approaches; Analyze code to evaluate time complexity using big O notation; Use existing Python libraries and data structures to solve problems using algorithms; Understand the main steps of important algorithms. Computer algorithms Computer programming Algorithms Algorithmes Programmation (Informatique) algorithms computer programming 1492091065 Erscheint auch als Druck-Ausgabe 1492091065 |
| spellingShingle | Heineman, George T. Learning algorithms a programmer's guide to writing better code Computer algorithms Computer programming Algorithms Algorithmes Programmation (Informatique) algorithms computer programming |
| title | Learning algorithms a programmer's guide to writing better code |
| title_auth | Learning algorithms a programmer's guide to writing better code |
| title_exact_search | Learning algorithms a programmer's guide to writing better code |
| title_full | Learning algorithms a programmer's guide to writing better code George T. Heineman |
| title_fullStr | Learning algorithms a programmer's guide to writing better code George T. Heineman |
| title_full_unstemmed | Learning algorithms a programmer's guide to writing better code George T. Heineman |
| title_short | Learning algorithms |
| title_sort | learning algorithms a programmer s guide to writing better code |
| title_sub | a programmer's guide to writing better code |
| topic | Computer algorithms Computer programming Algorithms Algorithmes Programmation (Informatique) algorithms computer programming |
| topic_facet | Computer algorithms Computer programming Algorithms Algorithmes Programmation (Informatique) algorithms computer programming |
| work_keys_str_mv | AT heinemangeorget learningalgorithmsaprogrammersguidetowritingbettercode |