What is the running time of an insertion sort algorithm if the input i – McqOptions

MCQOPTIONS

1.	What is the running time of an insertion sort algorithm if the input is pre-sorted?
A.	O(N<sup>2</sup>)
B.	O(N log N)
C.	O(N)
D.	O(M log N)
Answer» D. O(M log N)

Discussion

No Comment Found

Related MCQs

Which of the following examples represent the worst case input for an insertion sort?
For the best case input, the running time of an insertion sort algorithm is?
Which of the following sorting algorithms is the fastest for sorting small arrays?
Which of the following options contain the correct feature of an insertion sort algorithm?
Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.
In C, what are the basic loops required to perform an insertion sort?
Which of the following real time examples is based on insertion sort?
For the following question, how will the array elements look like after second pass?34, 8, 64, 51, 32, 21
What will be the number of passes to sort the elements using insertion sort?14, 12,16, 6, 3, 10
What is the running time of an insertion sort algorithm if the input is pre-sorted?

Related Topics

(MCQs) 1

(MCQs) 2

Recent Visits