McqMate

Q. |
## What is the average case time complexity of odd-even transposition sort? |

A. | o(n log n) |

B. | o(n) |

C. | o(log n) |

D. | o(n2) |

Answer» D. o(n2) |

4k

0

Do you find this helpful?

39

View all MCQs in

High Performance Computing (HPC)No comments yet

- Odd-even transposition sort is a variation of
- What is the worst case time complexity of a quick sort algorithm?
- The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations
- The complexity of bubble sort is Θ(n2).
- 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?
- What is the average running time of a quick sort algorithm?
- Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
- Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
- Time Complexity of DFS is? (V – number of vertices, E – number of edges)
- the complexity of quicksort is O(nlog n).