McqMate

Q. |
## The time complexity of quick sort is ………….. |

A. | o(n) |

B. | o(n2) |

C. | o(n log n) |

D. | o(log n) |

Answer» C. o(n log n) |

2.6k

0

Do you find this helpful?

17

View all MCQs in

Data Structures (DS)No comments yet

- Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- What is the worst case time complexity of LSD radix sort?
- What is the worst-case time for heap sort to sort an array of n elements?
- Quick sort uses ____ for implementation.
- Who invented Quick sort procedure?
- Which of following data structure is more appropriate for implementing quick sort iteratively?
- Quick sort is also known as ……..