It is log base 2 n
On Thu, May 15, 2008 at 4:49 PM, Vinodh <[EMAIL PROTECTED]> wrote: > > On any algorithm book they often specify the speed of the algorithm. > I often see many algorithms having speed factor O(nlogn). > > **Is it log base 2 n ? Or Is it log base 10 n?** > > Thanks, > Vinodh > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
