Sorting of uchar array of a million elements with sorted indices?

Hi @DragonSpit What to you suggest the best algorithm for sorting a ‘uchar array’ of a million elements and getting sorted indices? e.g. uchar data[10] = {2,8,6,25,255,23,96,102,235,0}; // actual one has million values

Output:

{4, 8, 7, 6, 3, 5, 1, 2, 0, 9}

[DragonSpit]

I’ve implemented the function you’re after, with an input of unsigned byte array and the output of sorted indexes. The function is SortRadixReturnIndexes(). Look for it at the bottom of RadixSort.cs source file in the HPCsharp folder. I have not tested it yet - will test it this weekend. Just wanted to give you a head start of thinking about porting it from C# to C++, which should be pretty simple, since the function is self contained and doesn’t call any other functions and uses nothing but arrays.

[DragonSpit]

You’re welcome. Yours is a very nice solution also, as it comes with the same realization that we need to reflect something (i.e. go backwards). Both should perform nearly the same.