Virtual Labs

HOME MENTORS CONTRIBUTORS

Aim
Theory
Pre Test
Procedure
Simulation
Post Test
References
Feedback

Pre Test

How many passes does an insertion sort algorithm consist of?

a : N b : N-1 c : N+1 d : N2

Which of the following examples represent the worst case input for an insertion sort?

a : array in sorted order b : array sorted in reverse order c : normal unsorted array d : large array

For the best case input, the running time of an insertion sort algorithm is??

a : Linear b : Binary c : Quadratic d : Depends on the input

What is the average case running time of an insertion sort algorithm?

a : O(N) b : O(N log N) c : O(log N) d : O(N2)

Developed by :

Contributors :

eBOOTATHON ==> IIT Kanpur | AKTU Lucknow | REC Banda | DBATU Lonere Maharastra