Search
- Filter Results
- Location
- Classification
- Include attachments
- https://eng.libretexts.org/Bookshelves/Introductory_Engineering/EGR_1010%3A_Introduction_to_Engineering_for_Engineers_and_Scientists/14%3A_Fundamentals_of_Engineering/14.02%3A_Arithmetic/14.2.04%3A_Combinations_and_PermutationsA permutation is a (possible) rearrangement of objects.
- https://eng.libretexts.org/Bookshelves/Computer_Science/Databases_and_Data_Structures/Open_Data_Structures_-_An_Introduction_(Morin)/01%3A_Introduction/1.03%3A_Mathematical_BackgroundIn all of the examples in this book, these probabilities are only with respect to the random choices made by the randomized data structure; there is no assumption that the data stored in the structure...In all of the examples in this book, these probabilities are only with respect to the random choices made by the randomized data structure; there is no assumption that the data stored in the structure, nor the sequence of operations performed on the data structure, is random.
- https://eng.libretexts.org/Courses/Oxnard_College/Matlab_and_Octave_Programming_for_STEM_Applications_(Smith)/03%3A_for_Loops_Ploting_Points_Sequences_and_Series/3.04%3A_for_Loops/3.4.01%3A_for_Loop_Supplemental_MaterialMore for loop instruction, examples, and exercises.
- 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/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.
