it is very simple......just think that for sufficiently large n...the
number of times the loop runs will be depend upon wat ?
for example
for(int i=0 to n)
{
for(int =0 to n)
{
//operations
//
}
}
for this the time complexity is O(n^2)
because for every i..it runs n times.....
for lg n it is more likely to form a binary tree....it is just 2 often used
term....for more ,refer algorithms book by thomas coreman
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
