@all I have come across this question earlier. it's a young's tableaus ( cormen pg. 167 ) can be treated as min heap. solution can be found in mit online study material.
i'll post the link here as soon as i remember it. On 1/24/12, atul anand <[email protected]> wrote: > @praveen : k way merge would require extra space right??....question is to > do it in place. > > On Tue, Jan 24, 2012 at 5:47 PM, praveen raj <[email protected]> wrote: > >> This can be done... k way merge... >> >> c- number of columns >> r- number of rows >> >> In O(c*r*log(r)) >> >> PRAVEEN RAJ >> DELHI COLLEGE OF ENGINEERING >> >> -- >> 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.
