A Unified O(log N) and Optimal Sorting Vector Algorithm

Abstract
A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary numbers with clog. Nbits on an SIMD multiprocessor system (SMMP) with processors and a composite interconnected network in time, where c is an arbitrary positive constant. When is an arbitrary small positive constant and u = log2 N, it is an O(logN) algorithm and when it is an optimal algorithm,pT = O(N log N)); where u = 1, c = 1 and e = 0.5 (a constant).

