//+------------------------------------------------------------------+//|                                                    GnomeSort.mq5 |//|                                    2019-2021, dimitri pecheritsa |//|                                        mql5.com/en/users/dmipec |//|------------------------------------------------------------------|//|  c  | gnome sort                                                |//|------------------------------------------------------------------|//| use | array sorting algorithm                                    |//|  best: n; average: n^2; worst: n^2                              |//|  memory: 1; stable: yes; method: exchanging                      |//|  note: tiny code size                                            |//|  originally proposed by iranian computer scientist hamid        |//|sarbazi-azad (professor of computer science and engineering at    |//|sharif university of technology) in 2000. the sort was first      |//|called stupid sort (not to be confused with bogosort), and then  |//|later described by dick grune and named gnome sort.              |//|  the gnome sort is a sorting algorithm which is similar to      |//|insertion sort in that it works with one item at a time but gets  |//|the item to the proper place by a series of swaps, similar to a  |//|bubble sort. it is conceptually simple, requiring no nested loops.|//|the average running time is o(n^2) but tends towards o(n) if the  |//|list is initially almost sorted.                                  |//|  the algorithm finds the first place where two adjacent elements |//|are in the wrong order and swaps them. it takes advantage of the  |//|fact that performing a swap can introduce a new out-of-order      |//|adjacent pair next to the previously swapped elements. it does not|//|assume that elements forward of the current position are sorted,  |//|so it only needs to check the position directly previous to the  |//|swapped elements.                                                |//|------------------------------------------------------------------|//|  f  | script program start function                              |//|------------------------------------------------------------------|//| use | gnome sort example. sort market watch symbols by spread    |//+------------------------------------------------------------------+#include <MqhAlgorithmsSortGnomeGnomeSort.mqh>
#include <MqhAlgorithmsSortGnomeFunctions.mqh>
voidOnStart(void)
  {
//--- load symbols from the warket watch window
  string symbols[];
  SymbolsLoad(symbols);
//--- load spreads of the symbols
  int keys[];
  SymbolKeysSpread(symbols,keys);
//--- sort symbols by spread in accending order
  ArraySort(keys,symbols,new CGnomeSort<int,string>);
//--- print a table of symbols to check result
  SymbolsPrint(symbols);
  }
//--------------------------------------------------------------------//Â Â Â Â Â Â Â Â Â Â Â Â Â Â symbol |Â Â spread |Â Â Â Â point//--------------------------------------------------------------------//Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â BRENT |Â Â Â Â Â Â Â Â 6 |Â Â Â Â 0.01//Â Â Â Â Â Â Â Â Â Â Â Â Â Â EURUSD |Â Â Â Â Â Â 16 |Â Â Â Â 1E-05//Â Â Â Â Â Â Â Â Â Â Â Â .US30Cash |Â Â Â Â Â Â 16 |Â Â Â Â Â Â 0.1//Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â TSLA |Â Â Â Â Â Â 47 |Â Â Â Â 0.01//Â Â Â Â Â Â Â Â Â Â Â Â Â Â XAUUSD |Â Â Â Â Â Â 300 |Â Â Â Â 0.001//Â Â Â Â Â Â Â Â Â Â Â Â Â Â USDRUB |Â Â Â Â Â Â 672 |Â Â 0.0001//Â Â Â Â Â Â Â Â Â Â Â Â Â Â BTCUSD |Â Â Â Â 13833 |Â Â Â Â 0.01//--------------------------------------------------------------------
insertion sort - array sorting algorithm - library… //+------------------------------------------------------------------+ //|                                                InsertionSort.mq5 | //|                                    2019-2021, dimitri pecheritsa | //|                                        mql5.com/en/users/dmipec | //|------------------------------------------------------------------| //| cls | insertion sort                                            | //|------------------------------------------------------------------| //| use…
selection sort - array sorting algorithm - library… //+------------------------------------------------------------------+ //|                                                SelectionSort.mq5 | //|                                    2019-2021, dimitri pecheritsa | //|                                        mql5.com/en/users/dmipec | //+------------------------------------------------------------------+ //| selection sort - array sorting algorithm                        | //+------------------------------------------------------------------+…
shell sort - array sorting algorithm - library MetaTrader 5 //+------------------------------------------------------------------+ //|                                                    ShellSort.mq5 | //|                                    2019-2021, dimitri pecheritsa | //|                                        mql5.com/en/users/dmipec | //+------------------------------------------------------------------+ //+------------------------------------------------------------------+ //| shell sort - array sorting algorithm                            |…
heap sort - array sorting algorithm - library MetaTrader 5 //+------------------------------------------------------------------+ //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â HeapSort.mq5 | //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â 2019 - 2021, dimitri pecheritsa | //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â https://www.mql5.com/en/users/dmipec | //+------------------------------------------------------------------+ //+------------------------------------------------------------------+ //| heap sort - array…
introsort - array sorting algorithm - library MetaTrader 5 //+------------------------------------------------------------------+ //|                                                    Introsort.mq5 | //|                                    2019-2021, dimitri pecheritsa | //|                                        mql5.com/en/users/dmipec | //|------------------------------------------------------------------| //|  c| array sorting algorithm                                    | //|  introsort or introspective…
merge sort - a merging method comparison-based… //+------------------------------------------------------------------+ //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â MergeSort.mq5 | //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â 2019-2020, dimitri pecheritsa | //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â 792112@gmail.com | //+------------------------------------------------------------------+ //Â Â merge sort - a merging method comparison-based sorting…
quick sort - sorting algorithm - library MetaTrader 5 //+------------------------------------------------------------------+ //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â QuickSort.mq5 | //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â 2019-2020, dimitri pecheritsa | //|Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â 792112@gmail.com | //+------------------------------------------------------------------+ // //Â Â quick sort - sorting algorithm // //Â Â …
MultiSort - sorting algorithm - library MetaTrader 5 A sorter class to sort an array based on other arrays. //+------------------------------------------------------------------+ //| class MultiSort<TItem,TKey1,TKey2,TKey3>.                        | //| Usage: Sorter class to…
