Chapter 2 : Recursion

0.0(0)
studied byStudied by 11 people
linked notesView linked note
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/3

flashcard set

Earn XP

Description and Tags

Computer Engineering

University/Undergrad

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

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