Answer Posted / mr. x
Lots of ppl asked, nobody had a clue.
The best sorting algorithm on average depends on the data to
be sorted. If the data is more or less well evenly
distributed, the best sorting algorithm is Radixsort or
Bucketsort, with average and worst cases of O(n).
Next are a class of very complex algorithms (impractical)
which are O(n log log n).
Next are the O(n log n) algorithms. Mergesort and Heapsort
both show average and worst case complexities of O(n log n).
Quicksort is to be avoided as the plague!!!!! It has
non-deterministic complexity and has a worst-case behaviour
of O(n^2). No wonder why there are so many crappy
applications out there.
Then Shellsort is pretty good for small-to-medium lists, as
long as you choose the best gaps (around O(n log^2 n)).
Otherwise it can perform O(n^4/3) or even O(n^2)!.
All other sorts are to be avoided, except for very specific
cases or when simplicity is far more important than code
velocity.
| Is This Answer Correct ? | 10 Yes | 4 No |
Post New Answer View All Answers
What the principle of quick sort and its complexity?
What is difference between array and arraylist?
What is best time complexity?
What are the advantages and disadvantages of linked list?
What are data structures in programming?
What is difference between concurrenthashmap and hashtable?
What is the time complexity of selection sort?
What are scalar values?
What is different between array and list?
What are the different types of linked list?
What do you mean by data and data structure?
Explain the priority queue?
What is a matrix? Explain its uses with an example
What is the difference between file structure and storage structure?
What is numeric array?
