Search
- Filter Results
- Location
- Classification
- Include attachments
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.00%3A_IntroductionThis page discusses recursion, a programming technique that simplifies complex solutions by allowing functions to call themselves with varying parameters. It highlights the compactness and efficiency ...This page discusses recursion, a programming technique that simplifies complex solutions by allowing functions to call themselves with varying parameters. It highlights the compactness and efficiency recursion brings to programming, especially in advanced scenarios.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.04%3A_More_Math_RecursionThis page covers the implementation of recursive functions for calculating Fibonacci numbers and the greatest common divisor (GCD) using Euclid's method. It explains the Fibonacci sequence, including ...This page covers the implementation of recursive functions for calculating Fibonacci numbers and the greatest common divisor (GCD) using Euclid's method. It explains the Fibonacci sequence, including a recursive function and example output. The GCD section defines the method and illustrates its recursive calculation with an example. Additionally, the text provides practice questions and encourages writing more recursive functions.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.05%3A_Using_Recursion_to_Solve_ProblemsThis page explores recursion in searching lists and solving the Three Towers problem. It details binary search, a recursive method for sorted lists that halves the search space by checking the middle ...This page explores recursion in searching lists and solving the Three Towers problem. It details binary search, a recursive method for sorted lists that halves the search space by checking the middle element. The Three Towers problem is similarly approached with recursion, organizing rings based on subproblems. Code examples highlight how recursion simplifies complex issues, enhancing efficiency in searching and problem-solving.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/16%3A_Answer_Key/16.11%3A_Chapter_12This page explores recursion in problem-solving, illustrating how complex tasks can be broken down into smaller ones. Examples include the Tower of Hanoi, summations, palindromes, Fibonacci calculatio...This page explores recursion in problem-solving, illustrating how complex tasks can be broken down into smaller ones. Examples include the Tower of Hanoi, summations, palindromes, Fibonacci calculations, and the greatest common divisor. It emphasizes the significance of base cases and provides guidance on implementing recursive functions while comparing the efficiency of recursive and iterative solutions in various scenarios.
- https://eng.libretexts.org/Bookshelves/Introductory_Engineering/EGR_1010%3A_Introduction_to_Engineering_for_Engineers_and_Scientists/16%3A_Beyond_the_basics_of_computersThis is just a preview of advanced concepts that might be useful for some disciplines. Here only a taste of the subject is presented, a full-on hard core computer science course would be needed to rea...This is just a preview of advanced concepts that might be useful for some disciplines. Here only a taste of the subject is presented, a full-on hard core computer science course would be needed to really learn these topics. Computer engineers should take those courses. For most these advanced concepts will not be needed but it does not hurt to have the idea in your head just in case.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_and_Computation_Fundamentals/Algorithm_Design_and_Analysis_(Justo)/01%3A_Fundamental_Design_and_Analysis_Techniques/1.02%3A_Activity_2_-_Recursion_and_Recursive_BacktrackingIf the recursive call succeeds, report the success to the next lower level, otherwise, Back out of the current choice to restore the state at the beginning of the loop. Finally, numbering diagonals to...If the recursive call succeeds, report the success to the next lower level, otherwise, Back out of the current choice to restore the state at the beginning of the loop. Finally, numbering diagonals to get the indices into the arrays is done in two ways as shown in Figure 1.2.12 . In the left board of Figure 1.2.12 “upDiag = row + col” and on the right board on the figure “downDiag = (boardSize – 1) + row – col”.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_RecursionThis page summarizes a chapter on recursion, covering its fundamentals, applications in mathematics, usage with strings and lists, advanced mathematical recursion, and problem-solving techniques using...This page summarizes a chapter on recursion, covering its fundamentals, applications in mathematics, usage with strings and lists, advanced mathematical recursion, and problem-solving techniques using recursion, culminating in a summary section.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.01%3A_Recursion_BasicsThis page explains recursion as a problem-solving technique that simplifies complex problems by addressing simpler variants. It highlights applications like the Tower of Hanoi, detailing the recursive...This page explains recursion as a problem-solving technique that simplifies complex problems by addressing simpler variants. It highlights applications like the Tower of Hanoi, detailing the recursive method for moving rings. Engaging questions help readers comprehend the steps needed for two, three, and four rings. The primary focus is on understanding how recursion aids in systematically constructing solutions.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/12%3A_Recursion/12.03%3A_Recursion_with_Strings_and_ListsThis page outlines learning objectives centered on using recursion in programming to solve string and list-related problems. It explains palindromes and how recursion can identify them, alongside the ...This page outlines learning objectives centered on using recursion in programming to solve string and list-related problems. It explains palindromes and how recursion can identify them, alongside the count() function for lists. The page includes checkpoints for understanding palindromes and list permutations, as well as practical exercises like creating a function to remove duplicates. Additionally, multimedia content is mentioned to enhance the learning experience.
- 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_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.
