**DOWNLOAD FREE PDF** **<<CLICK HERE>>**

## Insertion Sort Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed *Insertion Sort Multiple choice Questions and Answers (MCQs)*.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

**How many passes does an insertion sort algorithm consist of?**

N | |

N-1 | |

N+1 | |

N^{2} |

Question 1 Explanation:

An insertion algorithm consists of N-1 passes when an array of N elements is given.

Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

**Which of the following algorithm implementations is similar to that of an insertion sort?**

Binary heap | |

Quick sort | |

Merge sort | |

Radix sort |

Question 2 Explanation:

Insertion sort is similar to that of a binary heap algorithm because of the use of temporary variable to swap.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

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

O(N) | |

O(N log N) | |

O(log N) | |

O(N^{2}) |

Question 3 Explanation:

The average case analysis of a tight bound algorithm is mathematically achieved to be O(N

^{2}).Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

**Any algorithm that sorts by exchanging adjacent elements require O(N**

^{2}) on average.True | |

False |

Question 4 Explanation:

Each swap removes only one inversion, so O(N

^{2}) swaps are required.Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

**What is the average number of inversions in an array of N distinct numbers?**

N(N-1)/4 | |

N(N+1)/2 | |

N(N-1)/2 | |

N(N-1)/3 |

Question 5 Explanation:

The total number of pairs in a list L is N(N-1)/2. Thus, an average list has half this amount, or N(N-1)/4 inversions.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

There are 5 questions to complete.