468,145 Members | 1,379 Online
Bytes | Developer Community
New Post

Home Posts Topics Members FAQ

Post your question to a community of 468,145 developers. It's quick & easy.

How do I calculate these functions using the Big-O analysis?

74 64KB
I have worked out these answers prior to asking the question, but I am wondering if anyone could tell if I am calculating these functions right using the Big-O analysis? I have calculated the values of each function by only looking at the dominant term for the Big-O analysis. Here are the functions that I am inquiring about below:

Algorithm A: 23n + 36n2;
Algorithm B: 6 + nlog2(n) + n;
Algorithm C: log2n + 36n2.
Here are my work out answers to them below:
Algorithm A: 3.6 X 10^13
Algorithm B: (1,000,000)log2(1,000,000)= 19931568.5693
Algorithm C: 36(1,000,000)^2= 36(1,000,000)^2= 3.6 X 10^13
Sep 7 '17 #1
0 3143

Post your reply

Sign in to post your reply or Sign up for a free account.

Similar topics

6 posts views Thread by charliewest | last post: by
3 posts views Thread by Varun Kacholia | last post: by
3 posts views Thread by Ajith Menon | last post: by
1 post views Thread by arslanburney | last post: by
30 posts views Thread by didacticone | last post: by
1 post views Thread by gcdp | last post: by
By using this site, you agree to our Privacy Policy and Terms of Use.