how would you sort n sorted lists with average length K in O(n*log K) time?

Posted by SS on Stack Overflow See other posts from Stack Overflow or by SS
Published on 2010-03-20T03:43:00Z Indexed on 2010/03/20 3:51 UTC
Read the original article Hit count: 110

Filed under:

how would you sort n sorted lists with average length K in O(n*log K) time?

© Stack Overflow or respective owner

Related posts about algorithm