Sum Pro - An efficient linear approach to detect set equality

We present a new algorithm to test the equality of tests, which is highly efficient in terms of space and time complexity. Most existing methodologies make use of specialized data structures such as `tries´ to perform operations on sets and provide probabilistic results. In this paper, we introduce an algorithm that can perform with improved efficiency irrespective of the underlying data structure used. When compared with algorithms in existing literature, this method can determine equality with reduced memory requirements O (1) and in a single pass O (n). We show both, mathematically and through experiments that the proposed method fares better than its predecessors.