As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection networks, the N processors can interact with each other through direct links. In the interconnection networks, every processor has an independent local memory.
The term sorting means placing elements of a given set of elements, in an exact order i.e., alphabetic order /ascending order / descending order etc. Thus, sorting is one of the interesting problems come across in computations for a given data. In the present section, we would be discussing the various types of sorting algorithms for different computational models of parallel computers.
The formal representation of sorting problem is as explained: Specified a string of m numbers, say X= x1, x2, x3, x4 ................... xm and the order of the elements of the string X is initially arbitrary. The answer of the problem is to rearrange the elements of the string X such that the resultant sequence is in an ascending order.
Let us use the combinational circuits for sorting the string.