McqMate

Q. |
## What is the worst case time complexity of a quick sort algorithm? |

A. | o(n) |

B. | o(n log n) |

C. | o(n2) |

D. | o(log n) |

Answer» C. o(n2) |

2k

0

Do you find this helpful?

11

View all MCQs in

High Performance Computing (HPC)No comments yet

- What is the average running time of a quick sort algorithm?
- 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
- Pivot in Quick sort can be selected as
- Quick sort uses Recursive Decomposition
- In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE
- In Binary tree representation created by execution of Quick sort, Pivot is at
- In parallel Quick Sort Pivot is sent to processes by
- In parallel Quick Sort each process divides the unsorted list into
- In parallel quick sort Pivot selecton strategy is crucial for