- 0of 0 votes
Suppose S and T are two ordered dictionaries each containing n items. Both are implemented via sorted arrays and do not have any keys in common. Describe- inevitablekris October 13, 2014 in United States
an O(log n)-time algorithm that outputs the item whose key is the lower median in the union of S and T. For example, when the keys stored in S and T are
S = [3, 6, 7, 9] and T = [−1, 1, 2, 8], the lower median key is 3.
| Report Duplicate | Flag | PURGE
Open Chat in New Window