Sorting

Question

If we are asked to find best comparison based sorting algorithm to sort n numbers having d digit's and in the range from [1-k].

If I say it is quick sort or merge sort or heap sort is it wrong ?

OR in general we do sorting on these type of numbers using Radix sort only ?

Comments

@ Tesla! so it will be fine if i sort using any comparison based algorithm i will always get nlogn or should i use radix as it may give better performance.

---

But there will be serious issue in performance like if number are in order of n^2 then complexity will be n^2logn^2

---

complexity of comparison bases sorting algorithms is not dependent on #of digits in number and range , their complexity dependent on size of data(i mean total number to sort)..prefer radix sort when d is less otherwise nd becomes greater than nlogn.