Jesus4Lyf
Good Idea™
- Reaction score
- 397
Without any previous interest in the topic or investigations, I believe that all the following are untrue:
>However, you can't sort all the things with radix sort. With radix sort you're more or less restricted to sorting (bounded) ints.
>I don't think JASS supports Radix sort, and even if, this is sorting for linked lists, MergeSort is the best.
I don't see why a radix sort algorithm couldn't automatically bound detect, including for floats with decimal places, and I don't see why MergeSort is better than Radix. And of course JASS supports Radix...
I don't really know why anyone bothers using sort algorithms which -aren't- Radix...
Post-thought: Ok, it might not be very efficient for reals, with automatic length detection... scrap that thought perhaps. But I do presume it to be the best alternative for anything integer based, and I would just convert reals to integers if they were distances, seeing as sorting based on the <0.9 amounts is really trivial.
>However, you can't sort all the things with radix sort. With radix sort you're more or less restricted to sorting (bounded) ints.
>I don't think JASS supports Radix sort, and even if, this is sorting for linked lists, MergeSort is the best.
I don't see why a radix sort algorithm couldn't automatically bound detect, including for floats with decimal places, and I don't see why MergeSort is better than Radix. And of course JASS supports Radix...
I don't really know why anyone bothers using sort algorithms which -aren't- Radix...
Post-thought: Ok, it might not be very efficient for reals, with automatic length detection... scrap that thought perhaps. But I do presume it to be the best alternative for anything integer based, and I would just convert reals to integers if they were distances, seeing as sorting based on the <0.9 amounts is really trivial.