Этот материал находится в платной подписке. Оформи премиум подписку и смотри Recursion, Backtracking and Dynamic Programming in Java, а также все другие курсы, прямо сейчас!
• Урок 1. 00:02:09
Introduction
• Урок 2. 00:03:45
What are stack and heap memory?
• Урок 3. 00:06:15
Stack memory and heap memory simulation
• Урок 4. 00:08:44
Recursion introduction
• Урок 5. 00:05:05
• Урок 6. 00:10:10
Recursion and stack memory (stack overflow)
• Урок 7. 00:06:39
Head recursion and tail recursion implementation
• Урок 8. 00:06:07
• Урок 9. 00:04:15
Factorial problem - visualizing the stack
• Урок 10. 00:05:48
Factorial function - tail recursion
• Урок 11. 00:04:58
• Урок 12. 00:06:01
Towers of Hanoi problem introduction
• Урок 13. 00:05:39
Tower of Hanoi problem implementation
• Урок 14. 00:07:09
Towers of Hanoi - visualizing the stack
• Урок 15. 00:01:43
Iteration and recursion revisited
• Урок 16. 00:01:39
What is linear search?
• Урок 17. 00:03:17
Linear search implementation
• Урок 18. 00:03:49
What is binary (logarithmic) search?
• Урок 19. 00:08:54
Binary search implementation
• Урок 20. 00:06:44
Selection algorithms introduction
• Урок 21. 00:09:49
Quickselect introduction - Hoare algorithm
• Урок 22. 00:08:52
Quickselect visualization
• Урок 23. 00:11:57
Quickselect implementation
• Урок 24. 00:05:50
What the problem with pivots?
• Урок 25. 00:07:31
Advanced selection - median of medians algorithm
• Урок 26. 00:01:23
Combining algorithms - introselect algorithm
• Урок 27. 00:08:02
Online selection - the secretary problem
• Урок 28. 00:05:51
Backtracking introduction
• Урок 29. 00:04:03
Brute-force search and backtracking
• Урок 30. 00:08:07
N-queens problem introduction
• Урок 31. 00:03:10
What is the search tree?
• Урок 32. 00:09:22
N-queens problem implementation I
• Урок 33. 00:06:17
N-queens problem implementation II
• Урок 34. 00:06:22
N-queens problem and stack memory visualization
• Урок 35. 00:08:03
Hamiltonian paths (and cycles) introduction
• Урок 36. 00:04:42
Hamiltonian cycle illustration
• Урок 37. 00:10:17
Hamiltonian cycle implementation I
• Урок 38. 00:07:02
Hamiltonian cycle implementation II
• Урок 39. 00:08:49
Coloring problem introduction
• Урок 40. 00:04:33
Coloring problem visualization
• Урок 41. 00:07:18
Coloring problem implementation I
• Урок 42. 00:05:25
Coloring problem implementation II
• Урок 43. 00:03:55
Knight's tour introduction
• Урок 44. 00:10:33
Knight's tour implementation I
• Урок 45. 00:04:49
Knight's tour implementation II
• Урок 46. 00:04:59
Maze problem introduction
• Урок 47. 00:07:22
Maze problem implementation I
• Урок 48. 00:06:53
Maze problem implementation II
• Урок 49. 00:05:52
Sudoku introduction
• Урок 50. 00:08:38
Sudoku implementation I
• Урок 51. 00:03:28
Sudoku implementation II
• Урок 52. 00:05:05
What is the issue with NP-complete problems?
• Урок 53. 00:08:24
Dynamic programming introduction
• Урок 54. 00:03:31
Fibonacci numbers introduction
• Урок 55. 00:08:36
Fibonacci numbers implementation
• Урок 56. 00:18:08
Knapsack problem introduction
• Урок 57. 00:12:59
Knapsack problem example
• Урок 58. 00:08:08
Knapsack problem implementation I
• Урок 59. 00:04:27
Knapsack problem implementation II
• Урок 60. 00:08:04
Rod cutting problem introduction
• Урок 61. 00:11:07
Rod cutting problem example
• Урок 62. 00:08:46
Rod cutting problem implementation
• Урок 63. 00:10:12
Subset sum problem introduction
• Урок 64. 00:09:09
Subset sum problem example
• Урок 65. 00:09:05
Subset sum problem implementation
• Урок 66. 00:08:10
Bin packing problem introduction
• Урок 67. 00:06:53
Bin packing problem implementation
• Урок 68. 00:09:24
What are divide-and-conquer approaches?
• Урок 69. 00:01:46
Binary search revisited
• Урок 70. 00:08:18
Merge sort theory
• Урок 71. 00:06:27
Merge sort implementation
• Урок 72. 00:15:21
Closest pair of points problem introduction I
• Урок 73. 00:04:15
Closes pair of points problem introduction II
• Урок 74. 00:23:54
Closest pair of points implementation
• Урок 75. 00:08:01
Palindrome problem solution
• Урок 76. 00:07:01
Integer reversion solution
• Урок 77. 00:08:02
Two eggs problem solution I
• Урок 78. 00:11:40
Two eggs problem solution II
• Урок 79. 00:07:57
Duplicates in an array problem solution
• Урок 80. 00:03:52
Anagram problem solution
• Урок 81. 00:10:49
Largest sum subarray problem solution
• Урок 82. 00:00:42
What is Algorhyme?