[SOLVED] Data Structures H.W1-Asymptotic Boundaries

Problem 1 : show that 3n² + 25 is O(n²).

Problem 2 : if 4n³ + 7n² + 12 is O(n³) find its corresponding n₀ and k according to the Big O notation formula. problem 3 : show that nlog(n) − 2n + 13 is Ω(nlog(n)).

problem 4 : show that n² + 5n + 7 is Θ(n²). problem 5 : show that 0.5n² − 3n is Θ(n²).

problem 6 : show that 3n² + 8nlog(n) is Θ(n²).