This question already has an answer here:
- Sorting functions by asymptotic growth 6 answers
I am new to all of this and I am trying to understand how to define Time Complexity. I have an algorithm which performs a set of operations on inputs of different size.
While timing the execution of such algorithm I have figured out that the time elapsed follows an exponential law:
My question: is it correct to define this complexity according to