What's the upper bound of f(n) = n^4 + 100n^2 + 50?...

If f(n) = O(g(n)), is log(f(n)) = O(log(g(n))?...

If f(n)=O(g(n)), then shouldn't f(n)∗log2(f(n)^c)=O(g(n)∗log2(g(n))) depend on the value of C?...

How the time complexity of the following code is O(n)?...

The fastest algorithm to find the largest span (i,j) such that , ai + ai+1 +....+aj = bi + bi+1 +......

Difference between Big-O and Little-O Notation...

Running time of algorithm A is at least O(n²) - Why is it meaningless?...

Asymptotic behavior of algorithms and Big O comparison...

Asymptotic complexity of .NET collection classes...

Complexity of the recursion: T(n) = T(n-1) + T(n-2) + C...

Counting primitive operations?...

time and space complexity...

Expected running time vs. worst-case running time...

Bitonic Sort (Calculating complexity)...

What does it mean when it is stipulated that extra allowed space is O(1)?...

Solving recurrences...

How to calculate the upper bound time complexity (`"big O`") of a recursive function?...

Asymptotic. If f(n) = theta(g(n)) and g(n) = theta(h(n)), then why h(n) = theta(f(n))...

Are 2^n and 4^n in the same Big-Θ complexity class?...

Best and worst case time for Algorithm S when time complexity changes in accordance to n being even/...

Big-O time complexity for this recursive Fibonacci?...

Asymptotic complexity for typical expressions...

the asymptotic growth of n choose floor(n/2)...

How to determine if a function is of a specific asymptotic type in algorithm analysis?...

Heap Sort Complexity...

What are sublinear algorithms?...

Does a useful Haskell HashMap/HashTable/Dictionary library exist?...

Asymptotic Notation - does n (log n) (log n) simplify?...

Finding the upper bound of a mathematical function (function analysis)...

Solving recurrences with iteration, substitution, Master Theorem?...