A search-free intersection algorithm

Udomchaiporn, Akadej; Boonjing, Veera

doi:10.1109/ITNG.2008.225

A search-free intersection algorithm

Author(s)

Udomchaiporn, Akadej

Boonjing, Veera

Date Issued

May 27, 2008

Type

Conference Paper

DOI

10.1109/ITNG.2008.225

Abstract

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) 0(λ) times for the average case, where λ is an average size of sorted sets; and (3) 0(kn) times for the worst case, where k is the number of sorted sets and n is the total elements of k sorted sets. © 2008 IEEE.

Citation

Proceedings International Conference on Information Technology New Generations Itng 2008, 704-708, 2008