Data Structures - Hw1 -Solved

Asymptotic Boundaries


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

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

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

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