MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03075nam a22002657a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250307163640.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250307b ph ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9798888650356 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9798888650790 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Wengrow, Jay |
| Relator term |
author |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
A Common-Sense guide to data structures and algorithms in python, volume 1 / |
| Statement of responsibility, etc. |
Jay Wengrow |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Dallas, Texas : |
| Name of publisher, distributor, etc. |
Pragmatic Bookshelf, |
| Date of publication, distribution, etc. |
2023. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
482 pages. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD50.00 |
| 490 ## - SERIES STATEMENT |
|---|
| Volume/sequential designation |
Volume 1. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Preface -- <br/>Acknowledgments -- <br/>1. Why Data Structures Matter -- <br/>2. Why Algorithms Matter -- <br/>3. O Yes! Big O Notation -- <br/>4. Speeding Up Your Code with Big O -- <br/>5. Optimizing Code With and Without Big O -- <br/>6. Optimizing for Optimistic Scenarios -- <br/>7. Big O in Everyday Code -- <br/>8. Blazing Fast Lookup with Hash Tables -- <br/>9. Crafting Elegant Code with Stacks and Queues -- <br/>10. Recursively Recurse with Recursion -- <br/>11. Learning to Write in Recursive -- <br/>12. Dynamic Programming -- <br/>13. Recursive Algorithms for Speed -- <br/>14. Node-Based Data Structures -- <br/>15. Speeding Up All the Things with Binary Search Trees -- <br/>16. Keeping Your Priorities Straight with Heaps -- <br/>17. It Doesn't Hurt to Trie -- <br/>18. Connecting Everything with Graphs -- <br/>19. Dealing with Space Constraints -- <br/>20. Techniques for Code Optimization -- <br/>A1. Exercise Solutions -- <br/>Index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
If you thought data structures and algorithms were all just theory, you're missing out on what they can do for your Python code. Learn to use Big O notation to make your code run faster by orders of magnitude. Choose from data structures such as hash tables, trees, and graphs to increase your code's efficiency exponentially. With simple language and clear diagrams, this book makes this complex topic accessible, no matter your background. Every chapter features practice exercises to give you the hands-on information you need to master data structures and algorithms for your day-to-day work. Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today's web and mobile apps. Take a practical approach to data structures and algorithms, with techniques and real-world scenarios that you can use in your daily production code. The Python edition uses Python exclusively for all code examples, exercise, and solutions. Use Big O notation to measure and articulate the efficiency of your code, and modify your algorithm to make it faster. Find out how your choice of arrays, linked lists, and hash tables can dramatically affect the code you write. Use recursion to solve tricky problems and create algorithms that run exponentially faster than the alternatives. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
COMPUTER ALGORITHMS |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
DATA STRUCTURES (COMPUTER SCIENCE) |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="https://research.ebsco.com/c/nahjoz/search/details/7ktquxtvaf?db=nlebk&db=nlabk">https://research.ebsco.com/c/nahjoz/search/details/7ktquxtvaf?db=nlebk&db=nlabk</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Electronic Resources |
| Suppress in OPAC |
No |
