query: if n^3 has a fast rate of growth than n^2 i.e. O(n^2)<O(n^3) then why is n^2 better than n^3?
positive_passages.docid: 4100
positive_passages.text: What is a plain English explanation of "Big O" notation?
negative_passages.docid: 25765
negative_passages.text: Convergence radius of a power series 3
negative_passages.docid: 155138
negative_passages.text: Chebyshev polynomials increase more quickly than any other polynomial outside $[-1,1]$
negative_passages.docid: 9968
negative_passages.text: First-order logic advantage over second-order logic
negative_passages.docid: 43553
negative_passages.text: Which is optimal?
negative_passages.docid: 123397
negative_passages.text: Does the logarithm function grow slower than any polynomial?
negative_passages.docid: 57398
negative_passages.text: Where does TREE(n) sit on the Fast Growing Hierarchy?
negative_passages.docid: 70926
negative_passages.text: Showing that for $n\geq 3$ the inequality $(n+1)^n<n^{(n+1)}$ holds
negative_passages.docid: 86342
negative_passages.text: Why does $\log(n!)$ and $\log(n^n)$ have the same big-O complexity?
negative_passages.docid: 50534
negative_passages.text: Prove that if $n^2$ is divided by 3, then also $n$ can also be divided by 3.
negative_passages.docid: 70386
negative_passages.text: Proof by induction: $2^n > n^2$ for all integer $n$ greater than $4$
negative_passages.docid: 132573
negative_passages.text: Is "for(;;)" faster than "while (TRUE)"? If not, why do people use it?
negative_passages.docid: 71534
negative_passages.text: Combinatorial explanation for why $n^2 = {n \choose 2} + {n+1 \choose 2}$
negative_passages.docid: 90835
negative_passages.text: Use induction to prove that $2^n \gt n^3$ for every integer $n \ge 10$.
negative_passages.docid: 124870
negative_passages.text: Why is accumulate faster than a simple for cycle?
negative_passages.docid: 19510
negative_passages.text: Relationship between rate of convergence and order of convergence
negative_passages.docid: 10922
negative_passages.text: Speed vs Velocity