Question

Order following function by growth rate: N, √N, N^1.5, NlogN, log(N^2 ), N^2 , 2^N ,...

Order following function by growth rate: N, √N, N^1.5, NlogN, log(N^2 ), N^2 , 2^N , 300

Homework Answers

Answer #1

300 is constant.so 300 should come first compared to all.

Now compare  N, N0.5 ,N1.5 .0.5<1<1.5 so N^0.5 is less compared to N and N is less compared to N^1.5.

so order of N,N^0.5,N^1.5 is N^0.5<N<N^1.5.

Take NlogN and log(N^2)..log(N^2) is also written as 2logN.

Here 2logN is less compared to NlogN .So order is 2logN<NlogN.

compare logN and N^0.5...N^0.5>logN

compare NlogN and N^0.5...here NlogN>N^0.5

here N^1.5 >NlogN

2^N is larger than all the given times..so 2^N come at the end

order is 300<2logN<N^0.5<N<NlogN<N^1.5.<2^N

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Order the following functions by growth rate : N, N1/2, N1.5, N2, NlogN, N(logN)2, NlogN2, 2/N,...
Order the following functions by growth rate : N, N1/2, N1.5, N2, NlogN, N(logN)2, NlogN2, 2/N, 2N, 2N/2, 37, N3, and N2logN. Also, Indicate which functions grow at the same rate. Please complete and explain step by step
Put the following complexity classes in ascending order. O(n log n) O(n) O(2^n) O(n^3)
Put the following complexity classes in ascending order. O(n log n) O(n) O(2^n) O(n^3)
Given the following list of functions, determine the order of growth of each using big-Theta notation...
Given the following list of functions, determine the order of growth of each using big-Theta notation and put all the functions in order from slowest-growing to fastest-growing. Be sure to put functions of equal growth rate on the same level. Unless otherwise noted, you can assume all logarithms are base-2. 6nlog(2n)+8n 4n2log(log(8n))+8n2+n 500 n3+7nlog(n2) + 4n 2n+2n+1 log(4n2)+3n+1 12 8log(24n)+10 8n2log(5n2)+7n+200 4log(n3)+1000 100log(16n)log(n6)+23 8nlog(log(n4))+6n+32 9log(log(8n))
Rank the following functions by order of growth, in increasing order. You Must write the order...
Rank the following functions by order of growth, in increasing order. You Must write the order clearly. If two functions have the same growth rate - indicate them clearly with a remark. lg*n, n^2, lg n, 4^lg n, n lg n, ln ln n, n, 2^n, n!, n^(n+1), n^1.001, (3/2)^n, n lg lg n, 2^(n/2)
Solve the following recurrence relation using the technique of unrolling T(n) <= 2*T(n/2) + n*log(n), given...
Solve the following recurrence relation using the technique of unrolling T(n) <= 2*T(n/2) + n*log(n), given T(n <= 2) = 1
Find the appropriate "order" relationship between n log(n) and 10n and find the constants c and...
Find the appropriate "order" relationship between n log(n) and 10n and find the constants c and N. (i.e. f(n) < O(g(n)), etc.)
Plot the values for the following N = 10, 10^2 , 10^3,...., 10^10 use log scale...
Plot the values for the following N = 10, 10^2 , 10^3,...., 10^10 use log scale for both axes. N^1/3 , 10N+3, 3N+10logN, N log N , N-5, N^3, 1.0001^N Not sure where to start
Let H(n) = H(n/2) + log(n). Give matching upper and lower bounds for H(n) with the...
Let H(n) = H(n/2) + log(n). Give matching upper and lower bounds for H(n) with the following techniques: 1. Using a recursion tree 2. By substitution 3. Using the master theorem
2. (a) Find the entropy of a set of N oscillators of frequency ω as a...
2. (a) Find the entropy of a set of N oscillators of frequency ω as a function of the total quantum number n. Using the multiplicity function, g(N, n) = (N + n − 1)! n!(N − 1)! and make the Stirling approximation logN! ≈ NlogN − N. Replace N − 1 by N. (5 points)
Given the recurrence equation below, find running time T(n). T(n) = 8T(n/2) + n3 log n4...
Given the recurrence equation below, find running time T(n). T(n) = 8T(n/2) + n3 log n4 T(n) = 2T(n1/2) + log n
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT