Sorting the order of growth of the functions?
- by rachel7660
Please order the function belows by growth rate from fastest to slowest:
n^10
2^n
nlog(n)
10^6
And my answer is:
2^n
n^10
nlog(n)
10^6
Is my answer correct?
Search Results
Search found 3 results on 1 pages for 'rachel7660'.
Page 1/1 | 1
-
-
How to find the formula of best case and worst case of my algorithm?
- by rachel7660
I was given a task. Write an algorithm so that, the input of 2 lists of data, will have at least one in common. So, this is my algorithm: (I write the code in php) $arrayA = array('5', '6', '1', '2', '7'); $arrayB = array('9', '2', '1', '8', '3'); $arrayC = array(); foreach($arrayA as $val){ if(in_array($val, $arrayB)){ array_push($arrayC, $val); } } Thats my own algo, not sure if its a good one. So, based on my algorithm, how to find the formula of best case and worst case (big O)? Note: Please do let me know, if my algorithm is wrong. My goal is " input of 2 lists of data, will have at least one in common."Read the article
-
How to prove this statement of big o notation?
- by rachel7660
How to prove this: 4n = O(8 n)? What is the C (constant) and n0? Is it the same as 8n = O(4n)? What is the C and n0 for this?Read the article
