 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2016/discrete-mathematics-continuous-mathematics-and-probability/3/e/ii/solution

Positivity gives

max {f (n), g (n)} \leq f (n) + g (n)

. Thus

h (n) \leq f (n) + g (n)

for every positive

n

, meeting big O notation with constant

1

and threshold

1

. True: $h = O (f + g)$ .

 New to topics? Read the docs here!