Let f be a non negative function. Then we can define the three most common asymptotic bounds as follows.<\/p>\n
Big-Oh(O)<\/strong><\/p>\n We say that f(n) is Big-\u039f of g(n), written as f(n) = \u039f(g(n)), iff there are positive constants c and n0 such that<\/p>\n 0 \u2264 f(n) \u2264 c \u22c5 g(n) for all n \u2265 n0 Example<\/strong><\/p>\n Let us consider a given function:<\/p>\n f(n) = 4 \u22c5 n3 + 10n2 + 5n + 8 Solution:<\/strong><\/p>\n For above condition to be true Big-Omega (\u2126)<\/strong><\/p>\n We say that f(n) is Big-Omega of g(n), written as f(n) = \u2126(g(n)), iff there are positive constants c and n0 such that<\/p>\n 0 \u2264 c \u22c5 g(n) \u2264 f(n) for all n \u2265 n0 Example<\/strong><\/p>\n Let us consider a given function:<\/p>\n f (n) = 3n + 2 Big-Theta (\u0398)<\/strong><\/p>\n We say that f(n) is Big-Theta 0 \u2264 c1 \u22c5 g(n) \u2264 f(n) \u2264 c2 \u22c5 g(n) for all n \u2265 no<\/p>\n Equivalently, f(n) = \u0398(g(n)) if and only if f(n) = \u039f(g(n)) and f(n) = \u2126(g(n)). If f(n) = \u0398 (g(n)), we say that g(n) is a tight bound on f(n).<\/p>\n","protected":false},"excerpt":{"rendered":" Let f be a non negative function. Then we can define the three most common asymptotic bounds as follows. Big-Oh(O)<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1831,3],"tags":[1832,1833,1834,1835],"class_list":["post-6239","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-cs-it","tag-asymptotic-notations","tag-big-oho","tag-big-omega-","tag-big-theta-"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6239","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=6239"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6239\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=6239"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=6239"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=6239"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nIf f(n) = \u039f(g(n)), we say that g(n) is an upper bound<\/p>\n
\ng(n) = n3
\nChecking whether f(n) = \u039f(g(n)) or not?<\/p>\n
\n0 \u2264 f(n) \u2264 c \u22c5 g(n)
\n4n3 + 10n2 + 5n + 8 \u2264 c \u22c5 n3
\nwhen c = 5 and n \u2265 4
\nf(n) is always lesser than g(n)
\nHence above statement is true.<\/p>\n
\nIf f(n) = \u2126(g(n)), we say that g(n) is a lower bound<\/p>\n
\ng(n) = n
\nChecking whether f(n) = \u2126(g(n)) or not?
\nSolution:
\nFor above condition to be true
\n0 \u2264 c \u22c5 g(n) \u2264 f(n)
\nc \u22c5 n \u2264 3n + 2
\nwhen c = 1 and n \u2265 1
\ng(n) is always lesser than f(n)
\nHence above statement is true.<\/p>\n
\nBig-Theta of g(n), written as f(n) = \u0398(g(n)), iff there are positive constants c1, c2 and n0 such that<\/p>\n