Yes, its complexity is O(nlogn). On Sat, Oct 27, 2012 at 2:35 PM, CHIRANJEEV KUMAR <[email protected]>wrote:
> O(log( n! )); > > > On Sat, Oct 27, 2012 at 6:03 AM, payal gupta <[email protected]> wrote: > >> That 's correct. >> >> >> On Sat, Oct 27, 2012 at 3:25 AM, rahul sharma <[email protected]>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 [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. >>> >> >> -- >> 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. >> > > -- > 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. > -- Anil Kumar Sahu M. Tech.(Information Security) MNNIT Allahabad Ph. No:+91 8123065616, 8303325388 -- 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.
