Menu

Question Discussion & Solution

MCQ

Q.

What is not true about insertion sort?

A

Exhibits the worst case performance when the initial array is sorted in reverse order.

B

Worst case and average case performance is ?(n2)

C

Can be compared to the way a card player arranges his card from a card deck.

D

None of the above.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Which of the below given sorting techniques has highest best-case runtime complexity

A

quick sort

B

selection sort

C

insertion sort

D

bubble sort

Discussion

MCQ

2.

Which of the following has search efficiency of ?(1) ?

A

Tree

B

Heap

C

Hash Table

D

Linked-List

Discussion

MCQ

3.

What is not true about insertion sort?

A

Exhibits the worst case performance when the initial array is sorted in reverse order.

B

Worst case and average case performance is ?(n2)

C

Can be compared to the way a card player arranges his card from a card deck.

D

None of the above.

Discussion

MCQ

4.

The Sorting method which is used for external sort is

A

Bubble sort

B

Quick sort

C

Merge sort

D

Radix sort

E

Selection sort.

Discussion

MCQ

5.

How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?

A

4

B

5

C

6

D

7

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs