Difference between revisions of "TADM2E 2.13"
From Algorithm Wiki
| Line 5: | Line 5: | ||
| − | Since <math>a \le b, c \le d \implies a + c \le b + d</math> it follows that <math>f_1(n) \le {c_3}{g_1(n)}, | + | Since <math>a \le b, c \le d \implies a + c \le b + d</math> it follows that <math>f_1(n) \le {c_3}{g_1(n)}, f_2(n) \le {c_3}{g_2(n)} \implies f_1(n) + f_2(n) \le {c_3}({g_1(n)} + {g_2(n)})</math>. |
Therefore <math>f_1(n) + f_2(n) = O(g_1(n) +g_2(n))</math> | Therefore <math>f_1(n) + f_2(n) = O(g_1(n) +g_2(n))</math> | ||
Latest revision as of 15:35, 5 November 2016
Choose $ c_1 $ to satisfy $ f_1(n) \le {c_1}{g_1(n)} $ for all $ n \gt n_{1,0} $ and $ c_2 $ to satisfy $ f_2(n) \le {c_2}{g_2(n)} $ for all $ n \gt n_{2,0} $.
Note that $ c_1 $ and $ c_2 $ above can be substituted with $ c_3 $ such that $ c_3 = max(c_1, c_2) $ and the conditions still hold.
Since $ a \le b, c \le d \implies a + c \le b + d $ it follows that $ f_1(n) \le {c_3}{g_1(n)}, f_2(n) \le {c_3}{g_2(n)} \implies f_1(n) + f_2(n) \le {c_3}({g_1(n)} + {g_2(n)}) $.
Therefore $ f_1(n) + f_2(n) = O(g_1(n) +g_2(n)) $
