Design odd-even transposition algorithm, Computer Engineering

Assignment Help:

Q. Design Odd-Even Transposition Algorithm?

Algorithm: Odd-Even Transposition

for I=1 to N

    {      

     If (I%2 != 0) //i.e. Odd phase

           {     

            For j=1, 3, 5, 7,..................2*n/2-1

                    {

                          Apply compare-exchange (Pj, Pj+1)      //Operation is performed in parallel

                    } 

           }              

     else // Even phase

           {     

            For j=2, 4, 6, 8..................2*(n-1)/2-1

                    {

                          Apply compare-exchange (Pj, Pj+1) //Operation is performed in parallel

                    } 

           }

     I++  

   }


Related Discussions:- Design odd-even transposition algorithm

Predicates in first-order logic sentences , Predicates in first-order logic...

Predicates in first-order logic sentences - artificial intelligence There are predicates first and foremost in first-order logic sentences. These are indications that some thin

Real-time systems and control, A group report with no more than three stude...

A group report with no more than three students per group is to be handed in to explain your design procedures and simulation results. Representative graphical system outputs (clea

Process of interaction design, This unit starts by discussing the importanc...

This unit starts by discussing the importance of involving users in the interaction design process, explaining the reasons why user involvement can be useful, the different degrees

Define instruction code, Define Instruction Code. An Instruction code i...

Define Instruction Code. An Instruction code is a group of bits that instructs the computer to perform an exact operation. It is usually separated into parts, each having its o

Placement algorithm - process allocation, Placement algorithm - computer ar...

Placement algorithm - computer architecture: Different strategies can be taken as to how space is allocated to processes: First fit : Allocate the first hole that is la

Explain relative addressing scheme, Q. Explain Relative Addressing Scheme? ...

Q. Explain Relative Addressing Scheme? In this addressing technique the register R is the program counter (PC) which contains the address of current instruction being executed.

Difference between shadow and override in programming, Overriding tell us o...

Overriding tell us only the methods, but shadowing tells us the entire element.

What are the different methods of passing data, What are the different meth...

What are the different methods of passing data? There are three different methods of passing data Calling by reference    Calling by value Calling by value and result

Difference between finite automata and turing machine, What are the differe...

What are the difference between finite automata and Turing Machines?  Turing machine can alter symbols on its tape, while the FA cannot change symbols on tape.  Also  TM  has  a

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd