Q. Sorting Circuit along with Odd-Even Merging Circuit?
The merge sort algorithm needs two circuits which imply that one circuit for merging and another circuit for sorting the sequences. So the sorting circuit has been derived from the above discussed merging circuit. The fundamental steps followed by circuit are highlighted below:
i) The given input sequence of length n is splitted in 2 sub-sequences each of length n/2.
ii) The two sub sequences are sorted recursively.
iii) The two sorted sub sequences are then merged (n/2,n/2) employing a merging circuit in order to ultimately get the sorted sequence of length n.