- Computer Science Engineering (CSE)
- Data Structure (DS)
- The time complexity of quick sort is ………...

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) |

View all MCQs in:
Data Structure (DS)

- Which of following data structure is more appropriate for implementing quick sort iteratively?
- Quick sort is also known as ……..
- The time complexity of quicksort is ……..
- Worst space complexity of queue data structure is
- Worst space complexity of stack data structure is
- Worst space complexity of singly linked list is
- Which of the following is not the internal sort?
- The total number of comparisons in a bubble sort is ….
- The total number of elements in a stack at a given point of time can be calculated from the value of______.

Login to Continue

It will take less than 2 minutes

Report MCQ