Quick Sort MCQ

Test your knowledge with important Quick Sort MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Quick Sort MCQs at Bissoy

• Which of the following is not true about QuickSort?
  ক

  in-place algorithm

  খ

  pivot position can be changed

  গ

  adaptive sorting algorithm

  ঘ

  can be implemented as a stable sort
• What is the average case complexity of QuickSort?
  ক

  O(nlogn)

  খ

  O(logn)

  গ

  O(n)

  ঘ

  O(n2)
• What is the best case complexity of QuickSort?
  ক

  O(nlogn)

  খ

  O(logn)

  গ

  O(n)

  ঘ

  O(n2)
• What is a randomized QuickSort?
  ক

  The leftmost element is chosen as the pivot

  খ

  The rightmost element is chosen as the pivot

  গ

  Any element in the array is chosen as the pivot

  ঘ

  A random number is generated which is used as the pivot
• What is the worst case complexity of QuickSort?
  ক

  O(nlogn)

  খ

  O(logn)

  গ

  O(n)

  ঘ

  O(n2)
• Quick Sort can be categorized into which of the following?
  ক

  Brute Force technique

  খ

  Divide and conquer

  গ

  Greedy algorithm

  ঘ

  Dynamic programming