|
|
|
|
LEADER |
00000cam a2200000Mi 4500 |
001 |
OR_on1261307079 |
003 |
OCoLC |
005 |
20231017213018.0 |
006 |
m o d |
007 |
cr |n||||||||| |
008 |
210723t20212021caua o 001 0 eng d |
040 |
|
|
|a YDX
|b eng
|c YDX
|d YDX
|d UKAHL
|d N$T
|d OCLCO
|d AAA
|d OCLCF
|d OCLCO
|d OCLCQ
|d LANGC
|d OCLCQ
|d OCLCO
|
019 |
|
|
|a 1262325776
|a 1265320314
|a 1273960057
|a 1280071412
|
020 |
|
|
|a 9781492091035
|q (electronic bk.)
|
020 |
|
|
|a 1492091030
|q (electronic bk.)
|
020 |
|
|
|z 1492091065
|
020 |
|
|
|z 9781492091066
|
029 |
1 |
|
|a AU@
|b 000070544120
|
035 |
|
|
|a (OCoLC)1261307079
|z (OCoLC)1262325776
|z (OCoLC)1265320314
|z (OCoLC)1273960057
|z (OCoLC)1280071412
|
050 |
|
4 |
|a QA76.9.A43
|b H455 2021eb
|
082 |
0 |
4 |
|a 005.13
|2 23
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Heineman, George T.,
|e author.
|
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 resource (xiii, 263 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
336 |
|
|
|a still image
|b sti
|2 rdacontent
|
337 |
|
|
|a unmediated
|b n
|2 rdamedia
|
338 |
|
|
|a volume
|b nc
|2 rdacarrier
|
500 |
|
|
|a Includes index.
|
505 |
0 |
|
|a Foreword -- Preface -- Chapter 1. Problem Solving -- Chapter 2. Analyzing Algorithms -- Chapter 3. Better Living Through Better Hashing -- Chapter 4. Heaping It On -- Chapter 5. Sorting Without a Hat -- Chapter 6. Binary Trees: Infinity in the Palm of Your Hand -- Chapter 7. Graphs: Only Connect! -- Chapter 8. Wrapping It Up.
|
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.
|
588 |
|
|
|a Description based on online resource; title from digital title page (viewed on October 6, 2021).
|
590 |
|
|
|a O'Reilly
|b O'Reilly Online Learning: Academic/Public Library Edition
|
650 |
|
0 |
|a Computer algorithms.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
2 |
|a Algorithms
|
650 |
|
6 |
|a Algorithmes.
|
650 |
|
6 |
|a Programmation (Informatique)
|
650 |
|
7 |
|a algorithms.
|2 aat
|
650 |
|
7 |
|a computer programming.
|2 aat
|
650 |
|
7 |
|a Computer algorithms
|2 fast
|
650 |
|
7 |
|a Computer programming
|2 fast
|
776 |
0 |
8 |
|i Print version:
|z 1492091065
|z 9781492091066
|w (OCoLC)1243349644
|
856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781492091059/?ar
|z Texto completo (Requiere registro previo con correo institucional)
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH39072005
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 17556783
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 302342172
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH39022582
|
938 |
|
|
|a EBSCOhost
|b EBSC
|n 2970167
|
994 |
|
|
|a 92
|b IZTAP
|