|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/master-the-recursion-from-beginner-to-advance-level/
课程评论：没有评论
课程名称：C++递归大师班：从初学者到高级 课程概述：在学习递归时，您是否感到“卡住”了？本课程是一门完全适合初学者的递归大师班，将带您从基础到高级水平。递归是数据结构和算法中最重要的技术之一，递归问题在编码面试中也非常常见。如果您没有正确学习递归，在学习动态规划、树、图、回溯等主题时会面临许多困难，因为这些主题都涉及到递归。 课程内容将首先从基础开始，通过解决各种问题（如数组求和、线性搜索、二分搜索）来建立递归基础。然后，我们将进入中级问题，如使用递归排序数组、使用递归反转栈等。接着，我们将处理多个递归调用的高级问题，如打印数组的子集、子集和问题、数组的全排列、组合和等等。 您将学习到的内容包括： - 什么是递归？ - 递归的工作原理 - 递归在内存中的表现 - 递归函数中变量的作用域 - 递归函数的干运行 - 多个递归调用 - 如何以递归方式思考以解决任何递归问题 - 递归函数的时间和空间复杂度 - 如何设计基本案例 - 递归函数如何返回值 - 栈和栈帧 - 调试递归函数 - 堆栈溢出及如何避免 - 无限递归及如何避免 - 如何绘制递归树 - 提供的C++代码示例 课程将解决的编程问题包括： - 数组求和 - 从1到N打印数字 - 从N到1打印数字 - 1到N的和 - 二分搜索 - 使用递归排序数组 - 使用递归反转数组 - 使用递归删除栈的中间元素 - 斐波那契数列 - 使用递归打印数组的子集 - 打印唯一子集 - 子集和 - 组合和 - 打印数组的所有排列 - 生成长度为k的所有可能字符串 - 生成无连续1的所有二进制字符串 - 带空间的排列 - 生成所有平衡括号 - 大环中的约瑟夫问题（死亡游戏） 本课程的内容会不断扩展，您将获得免费更新。课程时长为10小时。完成课程后，您将成为递归大师，可以解决任何递归问题，请立即注册，我会在第一节课见到您。
Do you find yourself feeling like you get "stuck" while learning recursion?This is a complete beginner-friendly recursion masterclass that will take you from beginner to advance level.Recursion is one of the most important techniques in Data Structure and algorithms, recursion problems are also very commonly asked in coding interviews. If you don't learn recursion properly you will face many difficulties while learning Dynamic Programming, Trees, Graph, Backtracking etc because recursion is used in all of these topics.In this course we are going to start with the basics first we will build the recursion foundation by solving various problems like array sum, linear search, binary search etc.After building the recursion foundation we will move to intermediate level problems like sorting an array using recursion, reversing a stack using recursion etc.Then we will move to the advanced level problem which uses multiple recursion calls like a print subset of an array, subset sum problem, permutation of an array, combination sum and so on.This is what you will learnWhat is recursion?Working of recursion How does recursion work in memoryVariables scoped in recursive functionsDry run of recursion functionMultiple recursion callHow to think recursively to solve any recursion problemTime and space complexity of a recursion functionHow to design base caseHow recursive functions return valuesThe Stack and Stack FramesDebugging recursive functionsStack Overflow, and how to avoid itInfinite Recursion, and how to avoid itHow to draw a recursion treeCode samples are provided in C++List of coding problems that we are going to solve in this masterclassAll Problems we are going to solve using recursionArray SumPrint 1 to N numberPrint N to 1 number1 to N SumBinary searchSort an arraySort a stackReverse an array using recursionReverse a stackDelete the middle element of a stack using recursionFibonacci sequencePrint Subset of an array using recursion.Print unique subsetSubset sumsCombination sumCombination Sum Print all permutations of the array using recursionGenerate all possible strings of length kGenerate all binary strings without consecutive 1'sPermutation with spacesGenerate all balanced parenthesesPermutation with case changeJosephus problem (Game of Death in a circle)This course is constantly expanding, so you'll get free updates as the course expands. This course will be of 10 hours long.After completing this course you will become a master in recursion and you can solve any recursion problem so enroll now and I will meet you in the first lecture.
