0 votes 0 votes if T(n) = n2 √ n then T(n) = O(n2) T(n) = O(n2 log n) T(n) = O(n3) None of the above Im getting option 2 is it correct ? Algorithms nptel-quiz algorithms + – Dulqar asked Jan 24, 2017 Dulqar 5.0k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply mcjoshi commented Jan 24, 2017 reply Follow Share No, because $n^2logn = O(n^2 \sqrt{n})$ See How function behaves for large value of $n$. (say $n = 10^{1000}) 1 votes 1 votes mohit chawla commented Jan 24, 2017 reply Follow Share just for sake of answer, it should be O(n^3) 0 votes 0 votes Smriti012 commented Feb 3, 2017 reply Follow Share n2 √ n = omega (n2) n2 √ n = omega (n2 log n) n2 √ n = O(n3) *********** √ n is asymptotically greater than log n ******* –1 votes –1 votes Please log in or register to add a comment.