Algorithms

All lectures: All lectures on the discipline: algorithms are collected here. These fascinating lectures provide us with the opportunity to explore the deep principles and phenomena underlying our knowledge and our desire to understand the world.


1. Динамическое программирование
2. Evaluation of the effectiveness of the algorithm
3. Algorithm construction
4. From algorithm to data structure
5. Graph traversal algorithms
6. Depth search (depth-first search)
7. Search wide (breadth-first search)
8. Shortcut Search Algorithms
9. Floyd-Worshel Algorithm
10. Span trees of minimum cost
11. Kruskal algorithm
12. Prima algorithm
13. Maximum flow problem
14. Ford-Fulkerson algorithm
15. Search for maximum matching
16. Coloring graph
17. Coloring graphs Algorithm coloring graph. Practical application of graph coloring
18. Examples of tasks in graphs
19. Algorithm Chain
20. Algorithm for finding paths in the graph
21. Gears algorithm (graphs)
22. New Year's party decision through graphs
23. Cubes (solution using graphs)
24. Game (solution through graphs)
25. Rope telegraph (solution through graphs)
26. Secret Pipes (solution through graphs)
27. Metro (solution through graphs)
28. Network (solution through graphs)
29. Olympiad in Alchemy (decision through graphs)
30. Walls (solution through graphs)
31. Blockade (solution through graphs)
32. Order of growth of complexity
33. Cryptographic algorithms.
34. Dwarf sort
35. Shaker (mixing) sorting
36. Merge sort
37. Quick sort
38. Shell sort
39. Sort Inserts
40. Bubble sort
41. Binary search
42. Linear search
43. Sieve Sundaram
44. Quick exponentiation
45. Binary algorithm for calculating gcd
46. Euclidean algorithm
47. Sieve of Eratosthenes
48. Bellman - Ford Algorithm
49. Dijkstra's Algorithm
50. Sort in C language
51. Bubble Sort and Shaker Sort
52. Sort inserts in C language
53. Improved sorting algorithms (for example, the C language)
54. Select sorting method
55. Sort Rows and Sort Structures Using the C Language Example
56. Sorting disk files with random selection
57. Search Search Methods Sequential Search Binary Search in C
58. Hashing in programming using the example of the C language
59. C language expressions
60. Breaking up an expression into lexemes in the C language
61. Parsing Expressions with C
62. A simple program for parsing expressions on the example of the C language
63. Working with variables in the analyzer using the example of the C language
64. Syntax checking in a recursive downstream analyzer using the example of the C language
65. SCHEMES OF ALGORITHMS, PROGRAMS, DATA AND SYSTEMS. SYMBOLS AND EXECUTION RULES
66. Geometric algorithm
67. Search Task and Search Algorithms
68. Computational complexity
69. Algorithm Theory
70. the problem of flat laying graph
71. The problem of the least graph coverage
72. Search for common elements in an array
73. 18.2. Entropy as a measure of the degree of uncertainty of the state of a physical system
74. 18.3. Entropy of a complex system. Entropy addition theorem
75. Little's Algorithm - Traveling Salesman Problem Solution
76. Pyramid Sort (Heapsort, Heap Sort)
77. Интерполяционный (интерполирующий ) поиск с предсказанием местонахождения элемента
78. Классы сложности алгоритмов