## Reverse lookup for a sorted merged list

Given k sorted lists with comparable elements, where no two elements are equal, we could merge them into a new sorted list L by various algorithms. My question is, given the position of an element in this hypothetical list L, what is an efficient (be...

more
»