I need to sort a lot of rows (from 1GB to 3GB) by EpochTime (a single value of every row).
What is the fastest in-place sorting algorithm for this task? Radix Sort?
I would like the fastest sorting algorithm but I think that I could fail on limit of memory so I would prefer an in-place algorithm.
EpochTime should be unique (I didn't check). The Max and Min values are about a range of 4 hours, so they're pretty similar.
I'm asking this because I think there could be some optimization for some sorting alghoritms, also because epochtimes are pretty much known. I checked for Counting Sort (after all I'm talking about integers), but didnt' look like best case.