Зарегистрироваться
Восстановить пароль
FAQ по входу

Roughgarden T. Algorithms Illuminated. Part 3: Greedy Algorithms and Dynamic Programming

  • Файл формата pdf
  • размером 10,22 МБ
  • Добавлен пользователем
  • Описание отредактировано
Roughgarden T. Algorithms Illuminated. Part 3: Greedy Algorithms and Dynamic Programming
New York: Soundlikeyourself Publishing, LLC, 2019. — 229 p.
Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).
Познакомиться с дополнительными материалами и видеороликами автора (на английском языке) можно на здесь.
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация

Упоминается в тегах

Подробнее

Рафгарден Тим. Совершенный алгоритм. Roughgarden Tim. Algorithms Illuminated

Рафгарден Тим. Совершенный алгоритм — Серия книг в четырех частях; основана на онлайн-курсах по алгоритмам, которые Тим Рафгарден ведет на Coursera и Stanford Lagunita, и которые, в свою очередь, основаны на курсе бакалавриата, многократно преподававшемся им в Стэнфордском университете. Tim Roughgarden's Homepage The Algorithms Illuminated Book Series Tim Roughgarden's Online...
  • добавлен
  • отредактирован

Смотри также

Подробнее

Bhargava A. Grokking Algorithms: An illustrated guide for programmers and other curious people

  • pdf
Manning Publications, 2016. — 258 p. 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...
  • 24,82 МБ
  • добавлен
  • описание отредактировано
Подробнее

Roughgarden T. Algorithms Illuminated. Part 1. The Basics

  • pdf
New York: Soundlikeyourself Publishing, 2017. — 216 p. — ISBN: 978-0-9992829-1-5. Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and database system implementation. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical...
  • 5,52 МБ
  • добавлен
  • описание отредактировано
Подробнее

Roughgarden T. Algorithms Illuminated. Part 2: Graph Algorithms and Data Structures

  • pdf
Soundlikeyourself Publishing, LLC, 2018. — 221 p. — ISBN: 0999282921, 9780999282922. Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews....
  • 7,93 МБ
  • добавлен
  • описание отредактировано
Подробнее

Roughgarden T. Algorithms Illuminated. Part 4: Algorithms for NP-Hard Problems

  • pdf
New York: Soundlikeyourself Publishing, 2020. — 271 p. Fourth book in a series that provides an accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 4 covers algorithmic tools for tackling NP-hard problems (heuristic...
  • 15,52 МБ
  • добавлен
  • описание отредактировано
Подробнее

Sedgewick Robert, Wayne Kevin. Algorithms

  • pdf
4th Edition. — Addison-Wesley, 2011. — 969 p. — ISBN: 032157351X. Essential Information about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph...
  • 12,64 МБ
  • добавлен
  • описание отредактировано
Подробнее

Skiena S.S. The Algorithm Design Manual

  • pdf
3rd Edition. — Springer, 2020. — 800 p. — (Texts in Computer Science). — ISBN: 978-3-030-54256-6. Unique, handy reference package with a practical, hands-on appeal to a wide audience. This classic bestseller has been fully updated, and enhanced with new and expanded material on hashing and randomized algorithms, divide and conquer algorithms, and dealing with hard problems...
  • 9,93 МБ
  • добавлен
  • описание отредактировано
Наверх