Can somebody explain how it is O(n log n). What is the significance of while loop in the above code?
I understand that the for loop implies O(n),does the log n in the O(n log n) comes from the while loop? What if there where two while loops in the for loop separately? On Sat, Oct 27, 2012 at 3:26 AM, Pralay Biswas <[email protected]>wrote: > Yes! > > > On Fri, Oct 26, 2012 at 2:55 PM, 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.
