CS210 Tutorial 4

Complete the following exercises pasted below (or reference to texbook)

Q1. The number of operations executed by algorithms A and B is 8 n log n and 2 n², respectively. Determine n₀ such that A is better than B for n ≥ n₀.

Q2. The number of operations executed by algorithms A and B is 40n² and 2n³, respectively. Determine n₀ such that A is better than B for n ≥ n₀.

Q3. What is the sum of all the even numbers from 0 to 2 n, for any integer n ≥ 1?

Q4. Order the following functions by asymptotic growth rate.

Q5. Give Big-Oh characterization in terms of n for the following methods