0 votes 0 votes In GATE 1987 question, order of $\Sigma$$O(n)$ was found to be $O(n^2)$. Similarly, what will be the answer for order of $\Sigma$$O(n^2)$ ? Will it be of $O(n^3)$ ? Thanks! Algorithms algorithms asymptotic-notation + – someone asked Jun 12, 2018 • retagged Jul 8, 2022 by Lakshman Bhaiya someone 607 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes ∑O(n) = $\sum _{i=1}^{n}$ O (n) = O(n) $\sum _{i=1}^{n}$ 1 why because O(n) is constant ∑O(n) = O(n) { 1+1+1+...+1 ( n times ) } = O(n) . n = O(n2) like that ∑O(n2) = O(n2) { 1+1+1+...+1 ( n times ) } = O(n2) . n = O(n3) Shaik Masthan answered Jun 12, 2018 • selected Jun 12, 2018 by someone Shaik Masthan comment Share Follow See 1 comment See all 1 1 comment reply someone commented Jun 12, 2018 reply Follow Share thank you so much :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes This is the proof for the first part Miny answered Jun 15, 2018 Miny comment Share Follow See all 0 reply Please log in or register to add a comment.