Search
- Filter Results
- Location
- Classification
- Include attachments
- 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/Computer_Science/Programming_Languages/Python_Programming_(OpenStax)/05%3A_Loops/5.06%3A_Chapter_SummaryThis page discusses loop constructs in programming, including while and for loops, the range() function for integer sequences, and nested loops. It explains control statements like break and continue ...This page discusses loop constructs in programming, including while and for loops, the range() function for integer sequences, and nested loops. It explains control statements like break and continue and the use of an else statement with loops. The chapter provides examples and concludes with a practical exercise to write a program that prints the first N prime numbers.
- 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.
