Skip to content
Related Articles
Open in App
Not now

Related Articles

Algorithms | Sorting | Question 15

Improve Article
Save Article
Like Article
  • Difficulty Level : Easy
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article
Like Article

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.

(A)

Insertion Sort

(B)

Heap Sort

(C)

Merge Sort

(D)

Selection Sort


Answer: (A)

Explanation:

The insertion sort will O(n) time when input array is already sorted.


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Like Article
Save Article
Related Articles

Start Your Coding Journey Now!