Introsort (introspective sorting) - MetaTrader 5 library | MT5 EA download - MetaTrader 5 resources

Quick Sort <br/>Quick sort is a divide-and-conquer algorithm that works by selecting a pivot in the array, then dividing the other elements into two sub-arrays, checking whether the elements are greater or less than. On average, the quick sort algorithm takes O(nlog(n)) time, and the worst-case complexity is O(n ² ).

Heap sort <br/>The heap sort algorithm is a comparison sorting method based on binary heaps. It is an unstable sorting algorithm. The worst-case and average-case time complexity is O(nlog(n)), and the best-case time complexity is O(n).

Insertion Sort <br/>The insertion sort algorithm is a simple sorting method that builds the final sorted array in one go. The worst-case and average-case time complexity is O(n ² ), and the best-case is O(n).

The Introsort algorithm combines the advantages of these three algorithms. It starts with quick sort, switches to heap sort when the recursion depth exceeds a level based on the number of elements to start sorting, and switches to insertion sort when the number of elements is less than a certain threshold.

Introsort has particularly good runtime behavior. It is one of the fastest comparison sorting algorithms in use today, and is the common implementation of the std::sort algorithm provided by the C++ STL, the Microsoft .NET Framework class library, the GNU Standard C++ Library, and the LLVM libc++ library.

http://en.wikipedia.org/wiki/Introsort

https://iq.opengenus.org/intro-sort/

 //+------------------------------------------------------------------+
//|Introduction |
//+------------------------------------------------------------------+
/**
 * Use the less comparison function to sort the input array in place.
 * You can specify your own comparison function. If no function * is specified, ascending sorting is used.
 */
Template < type name > blankIntrosort (T &arr[]);