top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

What is the quickest sorting method to use?

+7 votes
461 views
What is the quickest sorting method to use?
posted Dec 6, 2013 by Neeraj Pandey

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

2 Answers

+2 votes

The answer depends on what you mean by quickest. For most sorting problems, it just doesn’t matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway. There are three sorting methods in this author’s toolbox that are all very fast and that are useful in different situations. Those methods are quick sort, merge sort, and radix sort.

answer Dec 6, 2013 by Prachi Agarwal
0 votes

This is context dependent, however following can be the consideration -

  1. Worst Case behavior,
  2. Average Case behavior
  3. Extra space needed
  4. Flexibility

So in summary your question is not very specific...

answer Dec 11, 2013 by Naveena Garg
Similar Questions
+2 votes

Can someone share the C code for selection or bubble sort for string. String comparison should be based on dictionary comparison.

+4 votes

How can we perform Sorting a list of strings without using any built-in sort method?

...