adplus-dvertising
frame-decoration

Question

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.

Posted under Sorting and Searching Data Structures and Algorithms

Answer: (d).None of the above.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is not true about insertion sort?
Add Comment

Similar Questions

Discover Related MCQs

Q. Which of the following has search efficiency of Ο(1) −

View solution

Q. Which of the following algorithm is not stable?

View solution

Q. Which of the below mentioned sorting algorithms are not stable?

View solution

Q. A pivot element to partition unsorted list is used in

View solution

Q. Which of the following algorithm does not divide the list −

View solution

Q. Time required to merge two sorted lists of size m and n, is

View solution

Q. Quick sort algorithm is an example of

View solution

Q. Quick sort running time depends on the selection of

View solution

Q. Which one of the below is not divide and conquer approach?

View solution

Q. Which of the following searching techniques do not require the data to be in sorted form

View solution

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

View solution

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

View solution

Q. An adaptive sorting algorithm −

View solution

Q. The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted −

View solution

Q. The worst case complexity of binary search matches with −

View solution

Q. The number of comparisons done by sequential search is ………………

View solution

Q. In ……………, search start at the beginning of the list and check every element in the list.

View solution

Q. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

View solution

Q. Which of the following is not the internal sort?

View solution

Q. In general, the binary search method needs no more than ……………. comparisons.

View solution
View All MCQs on Sorting and Searching

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...