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
hi,
can anybody plz tell me how to find the space and time complexity of an
algorithm in better and short way with example?
and
how we find that which approach should be applied to a problem so that we
will get its optimized solution with less complexity?
--
You received this message because
