Chapter 2 : Recursion
0.0(0)
Studied by 11 people
View linked note
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/3
Earn XP
Description and Tags
Last updated 1:22 PM on 12/18/22
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
4 Terms
1
New cards
Factorials
________ are often used in mathematics and computer science.
2
New cards
Recursion
________ is a method of problem- solving where you solve smaller instances of the problem until you arrive at a solution.
3
New cards
base case
The ________ is usually a simple, easily solvable case that serves as the starting point for the recursive algorithm.
4
New cards
Because of this, the function must have a base case
a condition that ends a recursive algorithm to stop it from continuing forever
