Here is my function. It is a simple one, I\'m just not confident on what the answer is. int calcul( int n) {
I want to compare following functions asymptotically and then开发者_如何学Python arrange them in the ascending order. Also requested is a proper explanation
I\'m asking this in regards to Top K algorithm. I\'d think that O(n + k log n) should be faster, because well.. for instance if you try plugging in k = 300 and n = 100000000 for example, we can see th
I had a test about asymptotic notations and there was a question: Consider the following: O(o(f(n)) = o(f(n))
Ar开发者_JAVA技巧e there any resources about the asymptotic complexity (big-O and the rest) of methods of .NET collection classes (Dictionary<K,V>, List<T> etc...)?
Give the smallest O() estimate you can for the following functions: 4n2 + 5n – 8 = O(...) log(n)2 + n = O(...)
Have a problem I\'m trying to work through and would very much appreciate some assistance! What\'s the time complexity of...
In T(n) = 2T(n/2) + M(n), where does the 2 in front of T come from.n/2 because it is dividing, and M(n) is linear, but I ca开发者_如何学Pythonn\'t figure out what the 2 is for?2, because you are perfo
How to solve this recurrence: T(n) = T(n/2) + T(n/4) + O(1) It doesn\'t seem like Master Method will help, as this is not in the form of T(n) = aT(n/b) + f(n). And I got stuck for quite 开发者_如何学
I\'ve got a homework question that\'s been puzzling me. It asks that you prove that the function Sum[log(i)*i^3, {i, n}) (ie. the sum of log(i)*i^3 from i=1 to n) is big-theta (log(n)*n^4).
加载中,请稍侯......