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)). Onotation 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
 Fall '08
 Davulcu,H
 Algorithms, Data Structures, Big O notation, Analysis of algorithms, Asymptotic analysis, Random access machine

Click to edit the document details