TIME COMPLEXITY

Question

Comments

it will be O(nlogn + logn*logn) = O(nlogn)

Answer 1

i loop will go upto $logn$ times...................i

for j     p value will be $\left ( n-1 \right )$

Now, k depends on p

k will go like $3^{1}+3^{2}+3^{3}+3^{4}+...............$

$=3^{k}-1$=$=3^{logn}-1=O\left ( n \right )$................ii

So,from i and ii complexity will be $O\left ( nlogn \right )$

Comments

@srestha

k will increase like  3¹ , 3² , 3³ , ............ 3^K     

3^K =n 

k=logn

=logn (n + logn) = O(nlogn)