Algorithms Flashcards
1
Q
What is a recursive function?
A
It’s a function in code that refers to itself for execution.
2
Q
What is Big O notation?
A
Big O notation is a way to measure an algorithm efficiently. It measures the time it takes to run your function as the input grows.
3
Q
Why are some algorithms considered unreasonable?
A
An unreasonable time algorithm is a problem that would take a massive amount of computing power to solve. The amount of time it would take to calculate a solution would be unreasonable.
