Chapter 2 : Recursion

studied byStudied by 11 people
0.0(0)
get a hint
hint

Factorials

1 / 3

Tags and Description

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 23 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 13 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 23 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 25 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 42 people
Updated ... ago
5.0 Stars(3)
note Note
studied byStudied by 4 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 149 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 131283 people
Updated ... ago
4.8 Stars(623)

Explore top flashcards

flashcards Flashcard504 terms
studied byStudied by 9 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard61 terms
studied byStudied by 43 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard60 terms
studied byStudied by 5 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard58 terms
studied byStudied by 5 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard64 terms
studied byStudied by 8 people
Updated ... ago
4.0 Stars(1)
flashcards Flashcard70 terms
studied byStudied by 285 people
Updated ... ago
5.0 Stars(6)
flashcards Flashcard38 terms
studied byStudied by 17 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard126 terms
studied byStudied by 24 people
Updated ... ago
5.0 Stars(1)