McqMate

Q. |
## The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations |

A. | 2n |

B. | n2 |

C. | n/2 |

D. | n |

Answer» C. n/2 |

1.8k

0

Do you find this helpful?

1

View all MCQs in

High Performance Computing (HPC)No comments yet

- Odd-even transposition sort is a variation of
- What is the average case time complexity of odd-even transposition sort?
- to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
- Suppose there are 16 elements in a series then how many phases will be required to sort the series using parallel odd-even bubble sort?
- Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
- Even under failure conditions Providing Quality of Service (QoS) assurance is the responsibility of?
- Group communication operations are built using which primitives?
- Which of the following is not a stable sorting algorithm in its typical implementation.
- which of the following is not an parallel algorithm model
- Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n) 2. begin 3. for i := n - 1 downto 1 do 4. for j := 1 to i do 5. compare-exchange(aj, aj + 1); 6. end X_SORT