Algorithms

Question 1

What is a recursive function?

Answer 1

It’s a function in code that refers to itself for execution.

Question 2

What is Big O notation?

Answer 2

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.

Question 3

Why are some algorithms considered unreasonable?

Answer 3

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.