Grokking algorithms an illustrated guide for programmers and other curious people

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...

Descripción completa

Detalles Bibliográficos
Otros Autores: Bhargava, Aditya Y., author (author)
Formato: Libro electrónico
Idioma:Inglés
Publicado: Shelter Island, New York : Manning [2016]
Edición:1st edition
Materias:
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009630227406719
Tabla de Contenidos:
  • Intro
  • Copyright
  • Brief Table of Contents
  • Table of Contents
  • Preface
  • Acknowledgments
  • About this Book
  • Chapter 1. Introduction to Algorithms
  • 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.