sorting circuit along with odd-even merging circuit, Computer Networking

As we previously know, the merge sort algorithm needs two circuits, i.e. one for merging and second for sorting the sequences. Thus, the sorting circuit has been derived from the above-discussed merging circuit. The useful steps followed by the circuit are given below:

i) The given input series of length n is separated into two sub-sequences of length n/2 each.

ii) The two sub series are recursively sorted.

iii) The two sorted sub series are merged (n/2,n/2) using a merging circuit in order to finally get the sorted series of length n.

Now, let us take an instance for sorting the n numbers say 4,2,10,12 8,7,6,9. The circuit of sorting + merging given series is illustrated in Figure.

Analysis of Merge Sort

i)          The width of the sorting + merging circuit is equivalent to the maximum number of devices needs in a stage is O (n/2). As in the above figure the maximum number of devices for a given stage is 4 which is n/2or8/2.

ii)      The circuit has two sorting circuits for sorting series of length n/2 and after that one merging circuit for merging of the two sorted sub series (see stage 4th in the above figure). Let the functions Tm and Ts denote the time complexity of merging and sorting in terms of its depth.

The Ts can be calculated as follows: Ts (n) =Ts (n/2) + Tm (n/2) Ts (n) =Ts (n/2) + log (n/2),

Thus, Ts (n) is equal to O(log2 n).

640_Sorting + Merging Circuit.png

                                                                   Sorting + Merging Circuit

Posted Date: 3/2/2013 6:48:10 AM | Location : United States

Related Discussions:- sorting circuit along with odd-even merging circuit, Assignment Help, Ask Question on sorting circuit along with odd-even merging circuit, Get Answer, Expert's Help, sorting circuit along with odd-even merging circuit Discussions

Write discussion on sorting circuit along with odd-even merging circuit
Your posts are moderated
Related Questions
DNS - Protocol Attacks Generally, in the DNS protocol, flaws are based on the implementation issues. The three common issues are generally, associated which can be of one of t

Question Which elementary logic gate is equivalent to this circuit? Show your working.

Distance vector-based routing algorithms (also called as Bellman-Ford algorithms) pass periodic copies of a routing table from router to router. Regular updates among routers commu

Features 1. Simple to install; 2. Simple to configure; 3. Multiple applications from one user can implement; 4. Multiple users can each use PVM concurrently; 5. C, C++, and

In communication weakening or loss of signal energy, typically caused by distance

Router A router is used to route (transfer) data among two or more same networks. It verifies the next network point to which a data packet should be forwarded. The router is l

What are TP-Lite and TP-Heavy Monitors? TP-Lite is simply the integration of TP Monitor functions in the database engines. TP-Heavy is TP Monitors which handles the Client/S