A Search-Free Intersection Algorithm

This paper proposes a new intersection algorithm of sorted sets. The new algorithm employs a comparison- and-elimination approach to the intersection problem instead of using search algorithms as existing intersection solutions. It takes (1) O(T) times for the best case; (2) O(lambda) times for the average case, where lambda is an average size of sorted sets; and (3) O(kn) times for the worst case, where k is the number of sorted sets and n is the total elements of k sorted sets.