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(1) times for the best case; (2) O(λ) times for the average case,??where λ 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.