This question already has an answer here:
- Sorting functions by asymptotic growth 6 answers
I have the following functions:
What is the correct order of these functions in increasing complexity?
I could always start entering values in these functions and check the corresponding output to notice the rate of increase. But is there a better, faster way of ranking these functions in order of increasing complexity? For example are there rules of thumb I could use to quickly sort these in order of increasing complexity? (Like I know generally exponential functions are more complex than log functions)