# H5 - [40 Homework 5 Big O[10 Select the best"big Oh notation for each expression Justify by showing the constants c and n0 Note that f(n = O(g(n if

This preview shows page 1. Sign up to view the full content.

[40] Homework 5 : Big O, Ω . [10] Select the best “big Oh” notation for each expression. Justify by showing the constants c and n 0 . Note that f ( n ) = O ( g ( n )) if there are constants c > 0 and n 0 > 0 so that for all n n 0 we have | f ( n ) | ≤ c · g ( n ). 1. 100 n + 1. 2. (10 n + 1) 3 . 3. 3 n 3 5 n 2 100. 4. n 2 + n + n + log n . [10] Show the following: 6 n 2 2 n = Θ( n 2 ) 6 n 2 log 3 n + 1 = O ( n 3 ) 3 n 3 + 44 n 2 = Ω( n 2 ) [10] Is (log n ) 2 = O (log n 2 )? Justify your answer?
This is the end of the preview. Sign up to access the rest of the document.

## This homework help was uploaded on 04/19/2008 for the course CS 182 taught by Professor W.szpankowski during the Fall '08 term at Purdue University-West Lafayette.

Ask a homework question - tutors are online