for k=1 to n
{
j=k;
while(j>0)
j=j/2;
}
the complexity is big o is o(nlogn)
am i ryt????-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
