Recursive Bubble Sort MCQ

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

• Bubble sort is an adaptive sorting algorithm.
  ক

  true

  খ

  false
• What is the auxiliary space complexity of recursive bubble sort?
  ক

  O(n)

  খ

  O(1)

  গ

  O(n log n)

  ঘ

  O(n2)
• What is the worst case time complexity of recursive bubble sort?
  ক

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

  O(log n)
• What is the best case time complexity of recursive bubble sort?
  ক

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

  O(log n)
• What is the average case time complexity of recursive bubble sort?
  ক

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

  O(log n)
• Recursive bubble sort is a comparison based sort.
  ক

  true

  খ

  false
• Which of the following is a variation of bubble sort?
  ক

  selection sort

  খ

  odd even sort

  গ

  cocktail sort

  ঘ

  stupid sort
• What will be the recurrence relation of the code of recursive bubble sort?
  ক

  T(n) = 2T(n/2) + n

  খ

  T(n) = 2T(n/2) + c

  গ

  T(n) = T(n-1) + n

  ঘ

  T(n) = T(n-1) + c
• Bubble sort is also known as ___________
  ক

  stupid sort

  খ

  ship sort

  গ

  sinking sort

  ঘ

  shell sort
• Which of the following is an advantage of recursive bubble sort over its iterative version?
  ক

  it has better time complexity

  খ

  it has better space complexity

  গ

  it is easy to implement

  ঘ

  it has no significant advantage