Given k sorted list merge them in optimal time. Assume that the total number of elements is n. Why this is useful for implementing the AND operator for a search engine?
(this is one of that questions that explains why basic algo knowledge is fundamental)
No comments:
Post a Comment