O(log( n! ));
On Sat, Oct 27, 2012 at 6:03 AM, payal gupta <gpt.pa...@gmail.com> wrote:
> That 's correct.
>
>
> On Sat, Oct 27, 2012 at 3:25 AM, rahul sharma <rahul23111...@gmail.com>wrote:
>
>> 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 algogeeks@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.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@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.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@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.
