Which complexity is less; O(n) or O(n logn)?
4100
What is a plain English explanation of "Big O" notation?
130094
Which is more preferable to write $\log(x)$ or $\ln(x)$
73050
Explanation of the binomial theorem and the associated Big O notation
151316
Is PHP's count() function O(1) or O(n) for arrays?
2378
Big O, how do you calculate/approximate it?
83909
Is $2^{2n} = O(2^n)$?
23526
Complexity of arithmetic in a finite field?
51671
lower bounding logarithm of sums
57398
Where does TREE(n) sit on the Fast Growing Hierarchy?
64680
Computational complexity of Fibonacci Sequence
114341
Classical algorithm with complexity similar to Shor's discovered: Are there more efficient quantum algorithms than Shor's?
20056
What algorithm is used by computers to calculate logarithms?
100832
Number of binary trees with $N$ nodes
124870
Why is accumulate faster than a simple for cycle?
81393
Asymptotic complexity of .NET collection classes
83146
Is there an approximation to the natural log function at large values?
4230
Time complexity of nested for-loop