Insertion Sort MCQ

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

• Which of the following is not an exchange sort?
  ক

  Bubble Sort

  খ

  Quick Sort

  গ

  Partition-exchange Sort

  ঘ

  Insertion Sort
• In insertion sort, the average number of comparisons required to place the 7th element into its correct position is ____
  ক

  9

  খ

  4

  গ

  7

  ঘ

  14
• Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order. Statement 2: And these elements are the m smallest elements in the array.
  ক

  Both the statements are true

  খ

  Statement 1 is true but statement 2 is false

  গ

  Statement 1 is false but statement 2 is true

  ঘ

  Both the statements are false
• Which of the following is good for sorting arrays having less than 100 elements?
  ক

  Quick Sort

  খ

  Selection Sort

  গ

  Merge Sort

  ঘ

  Insertion Sort
• Insertion sort is an example of an incremental algorithm.
  ক

  True

  খ

  False
• The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
  ক

  O(nlogn)

  খ

  O(n2)

  গ

  O(n)

  ঘ

  O(logn)
• Which of the following sorting algorithm is best suited if the elements are already sorted?
  ক

  Heap Sort

  খ

  Quick Sort

  গ

  Insertion Sort

  ঘ

  Merge Sort
• Which of the following is correct with regard to insertion sort?
  ক

  insertion sort is stable and it sorts In-place

  খ

  insertion sort is unstable and it sorts In-place

  গ

  insertion sort is stable and it does not sort In-place

  ঘ

  insertion sort is unstable and it does not sort In-place