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 138 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 16 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 28 people
Updated ... ago
5.0 Stars(3)
note Note
studied byStudied by 27 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 18 people
Updated ... ago
5.0 Stars(2)
note Note
studied byStudied by 2 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 11 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 10016 people
Updated ... ago
4.8 Stars(44)

Explore top flashcards

flashcards Flashcard33 terms
studied byStudied by 221 people
Updated ... ago
5.0 Stars(3)
flashcards Flashcard61 terms
studied byStudied by 16 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard79 terms
studied byStudied by 1 person
Updated ... ago
4.0 Stars(1)
flashcards Flashcard56 terms
studied byStudied by 9 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard62 terms
studied byStudied by 1 person
Updated ... ago
4.0 Stars(1)
flashcards Flashcard90 terms
studied byStudied by 3 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard143 terms
studied byStudied by 5 people
Updated ... ago
5.0 Stars(2)
flashcards Flashcard58 terms
studied byStudied by 239 people
Updated ... ago
5.0 Stars(4)