1 votes 1 votes Is there Any short cut to do these questions fast ? Algorithms time-complexity test-series + – Prince Sindhiya asked Oct 23, 2018 • retagged Jul 16, 2022 by Anjana5051 Prince Sindhiya 687 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Hemanth_13 commented Oct 24, 2018 reply Follow Share so time complexity is 1+(4*5/2)+(9*10/2)+..+(n2(n2+1)/2) = θ(n5) How was it n^5 ? 0 votes 0 votes Somoshree Datta 5 commented Oct 24, 2018 reply Follow Share summation of 14+24+34+...+n4 is $\theta$(n5)..that is what i know 1 votes 1 votes Hemanth_13 commented Oct 24, 2018 reply Follow Share Thank you :) Got my error. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Answer would be O(n^5) Prince Sindhiya answered Oct 24, 2018 Prince Sindhiya comment Share Follow See all 2 Comments See all 2 2 Comments reply Utkarsh Joshi commented Oct 24, 2018 reply Follow Share I agree! it would be O(n^5) only! 0 votes 0 votes Utkarsh Joshi commented Oct 24, 2018 reply Follow Share which test series is this? 0 votes 0 votes Please log in or register to add a comment.
