MARC details
| 000 -CABECERA |
|---|
| campo de control de longitud fija |
03351nam a2200313Ia 4500 |
| 001 - NÚMERO DE CONTROL |
|---|
| campo de control |
3390 |
| 008 - DATOS DE LONGITUD FIJA--INFORMACIÓN GENERAL |
|---|
| campo de control de longitud fija |
230305s2016 xx 000 0 und d |
| 020 ## - NÚMERO INTERNACIONAL ESTÁNDAR DEL LIBRO |
|---|
| Número Internacional Estándar del Libro |
9781617292231 |
| 040 ## - FUENTE DE LA CATALOGACIÓN |
|---|
| Centro/agencia transcriptor |
TBS |
| 041 ## - CÓDIGO DE LENGUA |
|---|
| Código de lengua del texto/banda sonora o título independiente |
eng |
| 043 ## - CÓDIGO DE ÁREA GEOGRÁFICA |
|---|
| Código de área geográfica |
en_UK |
| 245 #0 - MENCIÓN DE TÍTULO |
|---|
| Título |
Grokking algorithms |
| 260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. |
|---|
| Lugar de publicación, distribución, etc. |
Shelter Island, NY |
| Nombre del editor, distribuidor, etc. |
Manning Publications Co., |
| Fecha de publicación, distribución, etc. |
2016 |
| 300 ## - DESCRIPCIÓN FÍSICA |
|---|
| Extensión |
xviii, 238 pages : illustrations ; 24 cm |
| 500 ## - NOTA GENERAL |
|---|
| Nota general |
an illustrated guide for programmers and other curious people |
| 505 ## - NOTA DE CONTENIDO CON FORMATO |
|---|
| Nota de contenido con formato |
Chapter 1. Introduction to Algorithms |
| Mención de responsabilidad |
Chapter 2. Selection Sort-- |
| -- |
Chapter 3. Recursion-- |
| -- |
Chapter 4. Quicksort-- |
| -- |
Chapter 5. Hash Tables-- |
| -- |
Chapter 6. Breadth-first Search-- |
| -- |
Chapter 7. Dijkstra's algorithm-- |
| -- |
Chapter 8. Greedy algorithms-- |
| -- |
Chapter 9. Dynamic programming-- |
| -- |
Chapter 10. K-nearest neighbors-- |
| -- |
Chapter 11. Where to go next-- |
| -- |
Appendix. Answers to Exercises-- |
| -- |
Index-- |
| 520 ## - SUMARIO, ETC. |
|---|
| Sumario, etc. |
Grokking Algorithms is a fully illustrated, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. You'll start with sorting and searching and, as you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. Learning about algorithms doesn't have to be boring! Get a sneak peek at the fun, illustrated, and friendly examples you'll find in Grokking Algorithms on Manning Publications' YouTube channel. An algorithm is nothing more than a step-by-step procedure for solving a problem. The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to understand them but refuse to slog through dense multipage proofs, this is the book for you. This fully illustrated and engaging guide makes it easy to learn how to use the most important algorithms effectively in your own programs. Grokking Algorithms is a friendly take on this core computer science topic. In it, you'll learn how to apply common algorithms to the practical programming problems you face every day. You'll start with tasks like sorting and searching. As you build up your skills, you'll tackle more complex problems like data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them. |
| 590 ## - NOTA LOCAL (RLIN) |
|---|
| Procedencia (VM) [OBSOLETO] |
Includes index. ; ; This fully-illustrated and engaging guide makes it easy to learn how to use algorithms effectively. The book is a disarming take on a core computer science topic and shows readers how to apply common algorithms to practical problems faced in the day-to-day life of a programmer. It starts with problems like sorting and searching and builds up skills in thinking algorithmically. Then it tackles more complex concerns such as data compression or artificial intelligence. |
| 630 ## - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÍTULO UNIFORME |
|---|
| Título uniforme |
QA MATHEMATICS |
| 9 (RLIN) |
2046 |
| 650 ## - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
Computer algorithms |
| 9 (RLIN) |
13963 |
| 650 ## - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
Computer programming |
| Subdivisión general |
Handbooks |
| 9 (RLIN) |
13964 |
| 650 ## - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
manuals |
| 9 (RLIN) |
187 |
| 650 ## - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
|
| 700 ## - ENTRADA AGREGADA--NOMBRE PERSONAL |
|---|
| Nombre de persona |
Bhargava, Aditya Y. |
| Término indicativo de función/relación |
Autor |
| 902 ## - ELEMENTOS DE DATOS B LOCAL, LDB (RLIN) |
|---|
| a |
1651 |
| 905 ## - ELEMENTOS DE DATOS E LOCAL, LDE (RLIN) |
|---|
| a |
m |
| 942 ## - ELEMENTOS DE ENTRADA AGREGADA (KOHA) |
|---|
| Código de la institución [OBSOLETO] |
1 |
| Fuente del sistema de clasificación o colocación |
Clasificación Decimal Dewey |
