0 votes 0 votes Let $f(n)$ and $g(n)$ be asymptotically positive functions. Prove or disprove below fact (h) $f(n)+o(f(n))=\Theta(f(n))$ is it true? Algorithms asymptotic-notation + – Ayush Upadhyaya asked Aug 15, 2018 Ayush Upadhyaya 1.5k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply srestha commented Aug 15, 2018 reply Follow Share what is h? 0 votes 0 votes Ayush Upadhyaya commented Aug 15, 2018 reply Follow Share where is h? 0 votes 0 votes srestha commented Aug 15, 2018 reply Follow Share ok sorry, it is not correct I think $f(n)+o(f(n))=O(f(n))$ 0 votes 0 votes Shaik Masthan commented Aug 15, 2018 reply Follow Share @srestha why ? 0 votes 0 votes srestha commented Aug 15, 2018 reply Follow Share difference between small-o and Big-O is a '=' f(n) is exact value here and it brings '=' sign in the equation so it converted to big-O 1 votes 1 votes MiNiPanda commented Aug 15, 2018 reply Follow Share Let f(n) be n, then o(f(n)) is > f(n). So let it be n2. f(n) + o(f(n)) = c1*n + c2*n2 = ⊝(n2) ≠ ⊝(n) i.e. ⊝(f(n)) So I think it should be false. 1 votes 1 votes Shaik Masthan commented Aug 16, 2018 reply Follow Share @srestha, @MiNiPanda, Your Explanations satisfies me.... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I Think this statement is true, we can prove this using properties of asymptotic notation Let me know if am wrong. rksharma answered Aug 29, 2018 rksharma comment Share Follow See all 0 reply Please log in or register to add a comment.