You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: _posts/2013-01-17-2.2-the_big_oh_notation.md
+13-1Lines changed: 13 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -27,4 +27,16 @@ It's much easier to to talk in terms of simple upper and lower bounds of time-co
27
27
28
28

29
29
30
-
We are not concerned about small values of n (i.e., anything to the left of n0). The Big Oh notation enables us to ignore details and focus on the big picture.
30
+
We are not concerned about small values of n (i.e., anything to the left of n0). The Big Oh notation enables us to ignore details and focus on the big picture.
31
+
32
+
## Working with Big Oh
33
+
34
+
* addition: the sum of two functions is governed by the dominant one
35
+
36
+
O(f(n)) + O(g(n)) → O(max(f(n), g(n)))
37
+
38
+
* constant multiplication: can be ignored (if c>0)
0 commit comments