Asymptotically merge,heap and quick sort having same time as nlogn but they are used differently...

Question

Can someone explain about their proper usage..where we prefer which sorting and why???

Answer 1

I think this will clarify your doubt,

http://stackoverflow.com/questions/1933759/when-is-each-sorting-algorithm-used

also in linux kernel heap sort is used popularly, because of its worst case O( n logn ) complexity and O(1) space

you can go through that code if you want from here