Limitations of comparison based sorting techniques -
Comparison sort is selected in most scenarios where data must be ordered merge sort, quick sort, entry sort and Other comparative types, such as techniques, can handle different data types and efficiency with a lower limit of O (nLog (n)).
My questions are
- Are there any limitations to comparative sorting techniques?
- Will non-comparison sorting techniques be used in any kind of circumstance?
cheers
You have reduced the answer to this comparison Based sorting techniques are limited to the lower limit of O (n log (n)). Non-comparison based sorting techniques do not suffer from this limitation. The common problem with non-sorting algorithms is that domains should be better and for this reason they are not versatile in comparison to comparative techniques.
There is a very simple and simple example which is very fast as long as the number of possible key values is close to the number of elements.
Comments
Post a Comment