Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 45df881

Browse files
more on big oh
1 parent 622e525 commit 45df881

File tree

1 file changed

+5
-1
lines changed

1 file changed

+5
-1
lines changed

‎_posts/2013-01-17-2.2-the_big_oh_notation.md

Lines changed: 5 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,4 +39,8 @@ O(f(n)) + O(g(n)) => O(max(f(n), g(n)))
3939

4040
* multiplication: both operands are important:
4141

42-
O(f(n)) * O(g(n)) => O(f(n) * g(n))
42+
O(f(n)) * O(g(n)) => O(f(n) * g(n))
43+
44+
## Reasoning about efficiency
45+
46+
A basic rule of thumb in Big Oh analysis is that worst-case running time follows from multiplying the largest number of times each nested loop can iterate.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /