|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/recursion-and-backtracking-memoization-dc-combinations/
课程评论：没有评论
课程名称：递归与回溯 (记忆化、分治、组合) 课程概述： 本课程专为在理解递归和回溯（一种基于递归的技术）方面遇到困难的学习者设计。课程将深入讲解递归的基础知识，并探讨Divide and Conquer（分治）、Dynamic Programming（动态规划）和Backtracking（回溯，也称穷举搜索）等基础算法设计技术。通过解决大量相关问题，从简单的求和，到更复杂的组合、排列、记忆化、著名的Flood Fill（洪水填充）和N-Queens（N皇后）问题，帮助学习者全面掌握递归与回溯算法。
If you have trouble understanding Recursion and Backtracking, which is a recursion based technique, then this course is for you, since it is a course solely dedicated to Recursion and All types of Algorithms related to it. In this course the Basics of Recursion will be learned. The basic Algorithm Design techniques like Divide and Conquer, Dynamic Programming and Backtracking(Exhaustive Search) will be discussed and many problems related to them will be solved. Many different type of problems will be solved, from the simplest, finding the sum of numbers, to more difficult ones like Combinations, Permutations, Memoizations and the famous Flood Fill and N-queen Problem.
