Chapter 2 : Recursion

studied byStudied by 11 people
0.0(0)
Get a hint
Hint

Factorials

1 / 3

flashcard set

Earn XP

Description and Tags

4 Terms

1

Factorials

________ are often used in mathematics and computer science.

New cards
2

Recursion

________ is a method of problem- solving where you solve smaller instances of the problem until you arrive at a solution.

New cards
3

base case

The ________ is usually a simple, easily solvable case that serves as the starting point for the recursive algorithm.

New cards
4

Because of this, the function must have a base case

a condition that ends a recursive algorithm to stop it from continuing forever

New cards

Explore top notes

note Note
studied byStudied by 8 people
... ago
4.0(1)
note Note
studied byStudied by 5 people
... ago
5.0(1)
note Note
studied byStudied by 3 people
... ago
5.0(1)
note Note
studied byStudied by 13 people
... ago
5.0(1)
note Note
studied byStudied by 4 people
... ago
5.0(1)
note Note
studied byStudied by 65 people
... ago
5.0(1)
note Note
studied byStudied by 12 people
... ago
5.0(1)
note Note
studied byStudied by 28 people
... ago
5.0(1)

Explore top flashcards

flashcards Flashcard (61)
studied byStudied by 12 people
... ago
5.0(2)
flashcards Flashcard (30)
studied byStudied by 6 people
... ago
5.0(1)
flashcards Flashcard (41)
studied byStudied by 113 people
... ago
5.0(2)
flashcards Flashcard (31)
studied byStudied by 13 people
... ago
5.0(1)
flashcards Flashcard (32)
studied byStudied by 18 people
... ago
5.0(1)
flashcards Flashcard (34)
studied byStudied by 2 people
... ago
5.0(1)
flashcards Flashcard (20)
studied byStudied by 285 people
... ago
4.7(3)
flashcards Flashcard (61)
studied byStudied by 19 people
... ago
5.0(1)
robot