Полезные ссылки

Курсы

• MIT 6.006 Introduction to Algorithms + практика

• MIT 6.046J Design and Analysis of Algorithms + практика

• MIT 6.851 Advanced Data Structures + практика

• Specialization in algorithms from Stanford University

• Algorihtms from Prinson University part 1

• Algorihtms from Prinson University part 2

• Алгоритмы и структуры данных. Подготовительный курс (весна 2016) на основе лекций была написана книга(Algo book)

• Problem Solving with Algorithms and Data Structures

• План ИТМО

• Алгоритмы и алгоритмические языки

Дополнительные материалы

Discrete math

• What are some must-know topics in discrete math and probability for competitive programming?

  Computational Complexity

• Сложность алгоритмов (из Базовых алгоритмов для школьников)

• A Gentle Introduction to Algorithm Complexity Analysis

  • Перевод 1 2 3 4

• Know Thy Complexities! 1

• Difference between Big-O and Little-O Notation

• Effective stl containers

• Upper and lower bounds

  • Асимптотические обозначения и анализ алгоритма сортировки вставками (из Алгоритмы программирования и структуры данных)

  • Difference between Big-O and Little-O Notation и Family of Bachmann–Landau notations

    • Пример доказательства, что f(x) растет не быстрее чем g(x)

  • Практика для усвоения нотаций

• Recurrence Relations

  • Solved Recurrence - Substitution (Plug-and-chug) Method

  • Algorithms - Solving Recurrence Relations By Substitution

  • Solved Recurrence Tree Method

  • Recursion tree method - Example 1

  • Recurrence Relation Proof By Induction

• P vs. NP and the Computational Complexity Zoo

  • A Short Guide to Hard Problems (P, NP, PH, PSPACE, BQP, EXPTIME, BPP)

  • Important complexity classes

• Data Structure Visualizations

• Visualising data structures and algortihms

Divide and Conquer (and Combine)

• Decrease and Conquer: Decrease by a Constant, Decrease by a Constant Factor, Variable-Size-Decrease

• Topological sort

• Lowest Common Ancestor (LCA)

  • Lowest Common Ancestor Binary Search Tree

  • Lowest Common Ancestor Binary Tree

• Quick Sort

  • Quick Sort - step by step guide

  • Quicksort algorithm

  • Analysis of quicksort

Greedy Algorithm

• Kadane’s Algorithm (Max Sum Subarray) (хотя его чаще к Dynamic Programming относят)

• Huffman Coding

• Greedy Coloring Algorithm

  • Graph Coloring | Set 1 (Introduction and Applications)

  • LLVM Project Blog: Greedy Register Allocation in LLVM 3.0

• Fractional Knapsack Problem

Dynamic Programming

• Dynamic Programming

• Counting sort

• Rabin Karp (substring search)

• Detect a loop in a linked list (Floyd’s Algorithm)

• Detect Cycle in Directed Graph Algorithm

• Wildcard Matching

• Regular Expression Dynamic Programming

• Edit Distance

• 0/1 Knapsack Problem

Backtracking

• N Queen Problem

• Hamiltonian Cycle of a Graph

• Graph Colouring Problem

Branch and Bound

• What are the differences between ‘backtracking’ and ‘Branch & Bound’ algorithm techniques?

• Branch and bound: Applications

• 0/1 Knapsack problem (1, 2)

• Traveling Salesman

Local Search

• Local Search

• Iterated local search

• What are alternatives of Gradient Descent?)

• The Evolution of Gradient Descent

Transform and Conquer

• Transform and Conquer

Другое

• Tries

• Binary Heaps

• Error Control and CRC

• Traveling Salesman Problem Visualization

• Малый ШАД - Алгоритмы для NP трудных задач - Александр Куликов

• M* — алгоритм поиска кратчайшего пути, через весь мир, на смартфоне

• Алгоритмы и структуры данных в ядре Linux, Chromium и не только

Практика

• HackerRank

  • Algorithms

  • Data Structures

• LeetCode

• GeeksforGeeks

• Codeforces