Search
- Filter Results
- Location
- Classification
- Include attachments
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Data_Structure_and_Algorithms_(Njoroge)/02%3A_Recursion/2.01%3A_Activity_1_-_Recursive_AlgorithmThe learners are introduced to recursive processes and learn how a method calls itself in order to achieve repetitious behaviour. By using recursive algorithms, the learners will be in a position to s...The learners are introduced to recursive processes and learn how a method calls itself in order to achieve repetitious behaviour. By using recursive algorithms, the learners will be in a position to solve problems of this nature.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.06%3A_Chapter_SummaryThis page discusses recursion and its ability to simplify complex problems by dividing them into smaller cases. It covers identifying recursive and base cases, computing factorials, and solving proble...This page discusses recursion and its ability to simplify complex problems by dividing them into smaller cases. It covers identifying recursive and base cases, computing factorials, and solving problems with strings and lists. Additionally, it addresses Fibonacci number generation, efficient list searching, and the Three Towers problem, as well as introducing the built-in count() function for counting list elements, thereby equipping readers with practical recursion skills.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Data_Structures_(Wikibook)/01%3A_Introduction/1.03%3A_The_Principle_of_InductionFor example, let the property \(P(n)\) be the statement that "you can make a chain that holds \(n\) numbers". This is a property of natural numbers, because the sentence makes sense for specific value...For example, let the property \(P(n)\) be the statement that "you can make a chain that holds \(n\) numbers". This is a property of natural numbers, because the sentence makes sense for specific values of \(n\): After we prove that the statement is true for \(P(1)\), the base case, we can apply the inductive hypothesis to that fact to show that \(P(2)\) holds.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.02%3A_Simple_Math_RecursionThis page focuses on learning about recursive algorithms, specifically in calculating factorials. It defines factorials recursively, emphasizing recursive and base cases, and discusses Python's recurs...This page focuses on learning about recursive algorithms, specifically in calculating factorials. It defines factorials recursively, emphasizing recursive and base cases, and discusses Python's recursive function structure with essential stopping conditions. It provides examples like summation and Fibonacci sequences for practice and includes programming exercises to deepen understanding of recursion.
