McqMate

Q. |
## The complexity of bubble sort is Θ(n2). |

A. | true |

B. | false |

Answer» A. true |

1.4k

0

Do you find this helpful?

2

View all MCQs in

High Performance Computing (HPC)No comments yet

- 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?
- Bubble sort is difficult to parallelize since the algorithm has no concurrency.
- What is the worst case time complexity of a quick sort algorithm?
- What is the average case time complexity of odd-even transposition sort?
- Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
- the complexity of quicksort is O(nlog n).
- 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)
- Topological sort can be applied to which of the following graphs?
- In most of the cases, topological sort starts from a node which has __________