Difference between revisions of "TADM2E 2.15"

From Algorithm Wiki
Jump to: navigation, search
(Created page with "Choose <math>c_1</math> to satisfy <math>f_1(n) \le {c_1}{g_1(n)}</math> for all <math>n \gt n_{1,0}</math> and <math>c_2</math> to satisfy <math>f_2(n) \le {c_2}{g_2(n)}</mat...")
(2 intermediate revisions by the same user not shown)
Line 5: Line 5:
Since <math>a \le b, c \le d \implies a + b \le c + d</math> it follows that <math>f_1(n) \le {c_3}{g_1(n)}, f_1(n) \le {c_3}{g_1(n)} \implies f_1(n) + f_2(n) \le {c_3}({g_1(n)} + {g_2(n)})</math>.
Since <math>a \le b, c \le d \implies ac \le bd</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) \times f_2(n) \le {c_3}({g_1(n)} \times {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) \times f_2(n) = O(g_1(n) \times g_2(n))</math>

Latest revision as of 15:36, 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 ac \le bd $ 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) \times f_2(n) \le {c_3}({g_1(n)} \times {g_2(n)}) $.

Therefore $ f_1(n) \times f_2(n) = O(g_1(n) \times g_2(n)) $