I have some questions about data structures and algorithms

------------------------------------------------------------------------------

4n2 , log3n , 3n, 20n, 2 , log2n , n2/3

How can I graph these expressions.Andhow can I state the range of values of n for each expressions? which that expression is the most efficient?

-------------------------------------------------------------------------------

4n2, log3n, n!, 3n, 20n, 2, log2n, n2/3

How can I arange the following expressions by growth rate from slowest to fastest?

---------------------------------------------------------------------------------

when you answer these questions please express them step by step and give the details. (the numbers that is written right side on 'n' means power.

Re: I have some questions about data structures and algorithms

Quote:

*Originally posted by Tonyukuk *

**when you answer these questions please express them step by step and give the details.**

Because you teacher wasn't detailed enough when he/she explained it or because you didn't pay close enough attention?