We also write fnogn when fn is a member of ogn

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: )) when f(n) is a member of O(g(n)). Ω (g(n)) = { f(n): ∃ constants c and N s.t. f(n) ≥ c• g(n) for n ≥ N }. We also write f(n)= Ω (g(n)) when f(n) is a member of Ω (g(n)). O-notation is used to determine an upper bound on the order of growth of a function. Ω -notation is used to determine a lower bound on the order of growth of a function. 5 [email protected] Examples If f(n) = 2n + 3, then f(n) = O(n). If f(n) = n4 + 100n, then f(n) = O(n4). If f(n) = 1 + 2 + ... + n, then f(n) = O(n 2). If f(n) =...
View Full Document

This note was uploaded on 12/27/2013 for the course CSE 310 taught by Professor Davulcu,h during the Fall '08 term at ASU.

Ask a homework question - tutors are online