0 votes 0 votes I wanted to know how θ is derived for a problem. Can we write it directly Example n^4 + n^3+ n^2 Here worst case will be n^4 since it is the term with highest power(worst). Similarly can i get θ Algorithms algorithms time-complexity asymptotic-notation + – aka 53 asked Nov 25, 2017 aka 53 341 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Ashwin Kulkarni commented Nov 25, 2017 reply Follow Share I think here Best + worst /2 is still n^4. Hence $\Theta$ (n^4) 0 votes 0 votes Red_devil commented Nov 25, 2017 reply Follow Share For analysis of average case u will have to consider the time complexity for all inputs and than take their average here you will have to first compute s= Σi^4 + Σi^3 + Σi^2 for i=0 to n than Θ(n)=s/n. 1 votes 1 votes aka 53 commented Nov 25, 2017 reply Follow Share Ashwin how best case is n^4.how you came up that 0 votes 0 votes aka 53 commented Nov 25, 2017 reply Follow Share Red devil i get. You sliced it well Thanks for helping 1 votes 1 votes Please log in or register to add a comment.