|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/learn-recursion/
课程评论：没有评论
**课程名称：**Recursion (递归) **课程概述：** 本课程旨在帮助学习者深入理解和掌握递归这一重要的计算机科学概念。即使递归本身概念不难，但许多人在理解递归过程、确定基准情况（base cases）和递归情况（recursive cases）时常遇到困难。本课程将通过详细的讲解和生动的演示，帮助您克服这些障碍。此外，课程还包含 11 个已解决并详细讲解的编程问题，供您练习。 掌握递归不仅能为您提供一种新的思维方式——将问题分解为问题的多个实例——更能帮助您理解动态规划（dynamic programming）、回溯（backtracking）等高级技术。 **课程内容涵盖：** * 递归的定义 * 递归的代码实现与执行过程 * 基准情况（base cases）与递归情况（recursive cases） * 多重递归调用过程 * 调用栈（call stack） * 递归树（recursion tree） * 递归过程的可视化 * 递归函数复杂度分析（时间与空间复杂度） * 递归与迭代的比较 * 如何优化递归函数（记忆化和动态规划） * 分治法（Divide-and-conquer） * 回溯（Backtracking） * 递归数据结构 * 尾递归（Tail recursion） * 双递归（Double recursion） * 如何进行递归式思考 **实践编程问题（11个已解决并讲解）：** * 求数字各位之和 (Sum of digits) * 统计出现次数 (Count occurrences) * 相邻重复项 (Has adjacent duplicates) * 反转字符串 (Reverse string) * 矩阵中的最小成本路径 (Minimum cost path in matrix) * 所有可能的短语 (All possible phrases) * 键盘组合 (Keypad combinations) * 字符串子序列 (String subsequences) * 最多有两个零的二进制数 (Binary numbers with at most 2 zeros) * 单词搜索 (Word search) * 数组排列 (Array permutations) **选择本课程的理由：** * 对递归过程的详细解释 * 动画演示 * 良好的音频/视频质量 * 提供真实的英文字幕 * 包含可供练习的编程问题 * 在不理解时可以提问（注：课程概述中提到讲师目前不方便回答问题，但此项是“why you should take this course”中的优点，具体情况请留意课程详情。） **课程大纲：** 无
WARNING: The instructor is not currently available to answer questions regarding this courseEven if the concept of recursion is simple, a lot of people struggle with it (not understanding the recursive process, not being able to figure out the base cases and recursive cases...), this is why I wanted to create a course on recursion that explains it and illustrates it in detail, it also contains 11 solved and explained coding problems to practice.And knowing recursion will also give you a new way of thinking, which is dividing the problem into multiple instances of the same problem, which will help you understanding techniques like dynamic programming, backtracking...See you in the first lecture!The course covers:What is recursionCode and executionBase cases and recursive casesMultiple recursive calls processCall stackRecursion treeHow to visualize the processRecursive functions complexity analysis (time and space comp)Recursion vs IterationHow to optimize a recursive function (memoization and dynamic programming)Divide-and-conquerBacktrackingRecursive data structuresTail recursionDouble recursionHow to think recursivelyPlus 11 solved and explained coding problems to practice:Sum of digitsCount occurrencesHas adjacent duplicatesReverse stringMinimum cost path in matrixAll possible phrasesKeypad combinationsString subsequencesBinary numbers with at most 2 zerosWord searchArray permutationsWhy you should take this course:Detailed explanation of how the recursive process worksAnimated examplesGood audio/video qualityReal English captionsContains coding problems to practiceAbility to ask questions if you don't understand something
