Analysis of sort_bitonic, Computer Networking

The bitonic sorting network needed log n number of stages for performing the task of sorting the list. The first n-1 stages of the circuit are able to sort two n/2 numbers and the last stage uses a +BM (n) comparator having the depth of log n. As running time of the sorting is dependent upon the entire depth of the circuit, thus it can be depicted as:

D (n) = D (n/2) + log n

Answering the above mentioned recurrence relation

D (n)= (log2 n + log n)/2  = O(log2 n)

Thus, the complexity of solving a sorting algorithm using a combinational circuit is

O (log2 n).

 

Posted Date: 3/2/2013 6:43:28 AM | Location : United States







Related Discussions:- Analysis of sort_bitonic, Assignment Help, Ask Question on Analysis of sort_bitonic, Get Answer, Expert's Help, Analysis of sort_bitonic Discussions

Write discussion on Analysis of sort_bitonic
Your posts are moderated
Related Questions
What are advantages of having e-commerce over extranets

Tree topology Comments 1 - This features star nodes on a bus network 2 - All the disadvantages and advantages of both types of networks described above apply to this s

Q. Show the properties of Microwaves? Microwaves - Frequencies among 1 and 300 GHz - Unidirectional - Narrow focus requires sending as well as receiving antennas to

what is inheritance in computer systems special permissions?

Q. Show the Vulnerability of the Internet? More vulnerable than private network. Wide inter-network connection. Easy access by mass public world-wide. Lack of build in


what is the differnce between noise and distortion

The following issues are decided by the system in the process of message passing: 1) Whether the communication link is established or not 2) Whether the receiver is ready to

TCP/IP is a name provided to the collection (or suite) of networking protocols that have been used to construct the global Internet. The protocols are also referred to as the DoD (

Options The options  fields may be  used to  provide  other functions that are not  covered by  the header. If the length  of the  options  field is not  a multiple of 32 bits