The complexity of which of the following sorting algorithms remains to be the same in its best, average and worst case?
(a) quick sort
(b) insertion sort
(c) counting sort
(d) gnome sort
The question was asked in an online interview.
Origin of the question is Sorting in division Sorting of Data Structures & Algorithms II