Recursive Selection Sort MCQ

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

• What is the bidirectional variant of selection sort?
  ক

  cocktail sort

  খ

  bogo sort

  গ

  gnome sort

  ঘ

  bubble sort
• What is the average case time complexity of recursive selection sort?
  ক

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

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

  true

  খ

  false
• What will be the best case time complexity of recursive selection sort?
  ক

  O(n)

  খ

  O(n2)

  গ

  O(log n)

  ঘ

  O(n log n)
• What will be the recurrence relation of the code of recursive selection 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
• Which of the following is the biggest advantage of selection sort?
  ক

  its has low time complexity

  খ

  it has low space complexity

  গ

  it is easy to implement

  ঘ

  it requires only n swaps under any condition
• Which of the following sorting algorithm has best case time complexity of O(n2)?
  ক

  bubble sort

  খ

  selection sort

  গ

  insertion sort

  ঘ

  stupid sort