The Algorithms and Implementations of Multi-Point Parallel Searching and Sorting

The method of multi-point parallel searching and sorting is based on seting a number of comparators, which could be selected in practical realization. The method properly compromises the cost and performance through rational distributing the functions of hardware and software on searching and sorting processing. In this paper, some algorithms and implementations are presented.