Совершенный алгоритм. Основы

Алгоритмы-это сердце и душа информатики. Их приложения варьируются от сетевой маршрутизации и вычислительной геномики до криптографии с открытым ключом и машинного обучения. Изучение алгоритмов может сделать вас лучшим программистом, более ясным мыслителем и мастером технических интервью. Algorithms Illuminated-доступное введение в эту тему для тех, у кого есть хотя бы небольшой опыт программирования. (Вторая книга)

Экспозиция подчеркивает общую картину и концептуальное понимание над низкоуровневой реализацией и математическими деталями-как стенограмма того, что экспертный преподаватель алгоритмов сказал бы на серии уроков один на один. В этой книге Тим Рафгарден (Tim Roughgarden) — гуру алгоритмов — расскажет об асимптотическом анализе, нотации большое-О, алгоритмах «разделяй и властвуй», рандомизации, сортировки и отбора.

Книга «Совершенный алгоритм» адресована тем, у кого уже есть опыт программирования. Вы перейдете на новый уровень, чтобы увидеть общую картину, разобраться в низкоуровневых концепциях и математических нюансах. ISBN 978-5-4461-0907-4; (Серия «Библиотека программиста»).

Original book: Algorithms Illuminated: Part 1: The Basics
Tim Roughgarden

Publisher: Soundlikeyourself Publishing (September 27, 2017)
Language: English
ISBN-10: 0999282905
ISBN-13: 978-0999282908

Book description: Algorithms Illuminated: Part 1: The Basics

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.

Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons.

Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.

Original book: Algorithms Illuminated, Part 2: Graph Algorithms and Data Structures
Tim Roughgarden

Publisher: Soundlikeyourself Publishing, LLC; First edition (August 5, 2018)
Language: English
ISBN-10: 0999282921
ISBN-13: 978-0999282922

Book description: Algorithms Illuminated, Part 2: Graph Algorithms and Data Structures

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.

Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons.

Part 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).

Biography Tim Roughgarden.

Tim Roughgarden is a Professor of Computer Science at Columbia University. Prior to joining Columbia, he spent 15 years on the computer science faculty at Stanford, following a PhD at Cornell and a postdoc at UC Berkeley. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms.

For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Social Choice and Welfare Prize, the Mathematical Programming Society's Tucker Prize, and the EATCS-SIGACT Godel Prize.

He was an invited speaker at the 2006 International Congress of Mathematicians, the Shapley Lecturer at the 2008 World Congress of the Game Theory Society, and a Guggenheim Fellow in 2017. His books include Twenty Lectures on Algorithmic Game Theory (2016) and the Algorithms Illuminated book series (2017-2019).

Часть 2.

Часть 3.

Глава 1. Введение
Глава 2. Асимптотические обозначения
Глава 3. Алгоритмы «разделяй и властвуй»
Глава 4- Основной метод
Глава 5. Алгоритм Quicksort
Глава 6. Линейный выбор
Приложения

Algorithms - Tim Roughgarden - Stanford Lagunita

Algorithms Illuminated: Additional Resources

-Дополнительные материалы и видеоролики автора (на английском языке Algorithms Illuminated: Additional Resources links)

PDF ru

PDF part1-2 en

Github - algorithms-illuminated-Part 1, The Basics (code)

Github - algorithms-illuminated-Part 2, Graph Algorithms and Data Structures (code)

Soundlikeyourself Publishing links