Sorting algorithms

[Era Scarecrow]

On Monday, 15 October 2012 at 15:49:51 UTC, thedeemon wrote:
> On Monday, 15 October 2012 at 09:18:12 UTC, Era Scarecrow wrote:
> Big-O notation doesn't give you actual numbers, O(n) = O(25*n). 
> If you're interested in a practical method, look at TimSort and 
> similar ones that combine different algorithms.

  Yeah I know it's more of a generalized number of steps, but it 
still gives you a good idea of sorting time. I'll give TimSort a 
look over.

  Currently I'm estimating this will be a variant of merge-sort.