Libraries: Radix sort (The fastest numeric sort)

Automated-Trading 2022.03.27 19:56

Sorts the values of a one-dimensional numeric array in the ascending order. It is 3-10 times faster than any other sorting algorithm.

Author: amrali

fxsaber 2022.03.28 05:54 #1

Great job! The speed advantage drops by a factor of 2.5 when moving from int[] to double[].

amrali 2022.03.28 10:21 #2

fxsaber #:
Great job! The speed advantage drops by a factor of 2.5 when moving from int[] to double[].

Still the fastest way you can sort floats. Faster than qsort.

Jason Kisogloo 2022.03.28 11:04 #3

This could be useful to many ;) well done ;)

amrali 2022.04.01 16:09 #4

What is this negativity?! I dont know the reason of bad stars.

If you have any suggestions or improvement please add them to the discussion.

amrali 2022.04.10 17:15 #5

Update 10 April 2022

More optimized implementation with a faster speed.

fxsaber 2022.11.05 12:22 #6

amrali #:

Update 10 April 2022

More optimized implementation with a faster speed.

Benchmark.

Faster:

      //--- copy back from temp to arr
    #ifdef __MQL5__
      ArraySwap(arr, temp);
    #else // #ifdef __MQL5__
      ArrayCopy(arr, temp);
    #endif // #ifdef __MQL5__ #else

fxsaber 2022.11.05 16:24 #7

#include <RadixSort.mqh> // https://www.mql5.com/en/code/38763

void OnStart()
{
  int Array[];
  
  RadixSort(Array); // array out of range in 'RadixSort.mqh'
}