Q. Explain about Merge sort circuit?
First split the given sequence of n numbers in two parts every part comprising of n/2 numbers. Afterwards recursively divide the sequence into two parts till each number behaves as an independent sequence. As a result the independent numbers are first sorted and recursively merged till a sorted sequence of n numbers isn't attained.
In order to carry out the above-mentioned task there would be two kinds of circuits that would be used in subsequent manner the first one for sorting and other one for merging the sorted list of numbers.