Aviva sorting network
Avinash Bansal · 2012
A sorting network is a mathematical model which can be used as a multiple-input, multiple-output switching network [1]. Sorting network has been one of the most critical applications on parallel computing machines. Many classic textbooks on algorithms like Thomas H. Cormen, therefore considered this problem in great detail and listed many sorting network for this purpose [2]. Sorting networks CLR90, Sav98 turned out to be convenient mean to describe certain parallel sorting algorithms [2]. In this paper we have introduced a new sorting network having time complexity (log2N)2of theoretically and practically, where N is the number of elements. This network has a special feature it will always give the data in the required sequence (ascending or descending order) and feed the input from any direction (moving from left to right or from right to left).