sory its not not as i said ;(
On Sat, Jul 3, 2010 at 6:21 PM, jalaj jaiswal <[email protected]>wrote: > merge two lists at a time ... in O(k) > thus reducing number of lists to half at every step > i.e n*logk > its more like bottom up merge sort .. look for it > > > On Sat, Jul 3, 2010 at 11:06 AM, divya <[email protected]> wrote: > >> How do you merge n sorted lists with average length K in O(n*log(K)) >> time? >> >> -- >> 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]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > With Regards, > Jalaj Jaiswal > +919026283397 > B.TECH IT > IIIT ALLAHABAD > -- With Regards, Jalaj Jaiswal +919026283397 B.TECH IT IIIT ALLAHABAD -- 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.
