for(i=0;i<n;i++)
for(j=0;j<i*i;j++)
for(k=0;k<j;k++)
sum++;
Is it n^5 log n ..... n * (n^2 log n) * (n^2 log n) ???
correct me if i m wrong? also anybody can tell some easy approach to tackle
these ques ?? I worked out for some values of n and arrived at the ans.....
....
--
Regards,
$iva
--
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.
