I got a hallucinated @airtable formula called arraysort() but it was from chatgpt

RadixSort algorithm efficiently organizes numeric data by sorting from the least significant to the most significant digit. This approach works well for both integer and float data types. The time complexity of RadixSort is O(n * k), where 'n' is the number of elements and 'k' represents the maximum number of bytes in the elements. The method iterates over each byte position to sort the data accordingly. In conjunction with MQL, a highly-optimized LSD RadixSort implementation is available, leveraging radix 256 (8-bits). This version is capable of handling large arrays with millions of numbers efficiently. Stemming from Pierre Terdiman's work, it incorporates various optimizations for enhanced performance, attaining speeds of 3-10 times faster than MQL's native ArraySort() function. This implementation accepts arrays of different types but sorts them b... #MQL5 #MT5 #Algorithm #Sorting mql5.com/en/code/38763?utm_s…

// ------------------------------------------------------------------ //| test.mq5 | //| Copyright 2024, MetaQuotes Ltd. | //| mql5.com | // ------------------------------------------------------------------ #property copyright "Copyright 2024, MetaQuotes Ltd." #property link "mql5.com" #property version "1.00" // ------------------------------------------------------------------ //| Expert initialization function | // ------------------------------------------------------------------ int OnInit() { //--- double arrayData[]; arrayData.Push(rand()); arrayData.Push(rand()); arrayData.Push(rand()); arrayData.Push(rand()); arrayData.Push(rand()); ArraySort(arrayData); for(int i = 0;i < arrayData.Size();i ) { Print(arrayData[i]); } //--- return(INIT_SUCCEEDED); } // ------------------------------------------------------------------ //| Expert deinitialization function | // ------------------------------------------------------------------ void OnDeinit(const int reason) { //--- } // ------------------------------------------------------------------ //| Expert tick function | // ------------------------------------------------------------------ void OnTick() { //--- } // ------------------------------------------------------------------

MQL5逆引き講座 関数を使って配列のソートを行ってみよう‼️ どうやるかというと、ArraySort関数で、簡単に照準に変更可能。 for文など用いずに、一行でソートが完了します。 プログラムはリプ欄へ⬇️

ArraySort関数は、多次元の数値配列において、最初の次元（0番目の次元）の値を昇順にソートするための関数です。 この関数を使用すると、配列内のデータを並べ替えることができ、特にデータの分析や処理を行う際に便利です。 mqlinvestmentlab.com/aboutar…

ну это сложно:) я начинал с этими функциями через кликхаусовские arraySort() если бы это смешали с редьюсом то голова бы лопнула так что лучше отдельно да.

Here's an extreme case where I unplugged my laptop mid-run. Every data series shows a bimodal distribution, but you can still easily tell that Array.sort(18) is faster than ArraySort(20).

𝐃𝐢𝐟𝐟𝐞𝐫𝐞𝐧𝐜𝐞 𝐛𝐞𝐭𝐰𝐞𝐞𝐧 𝐀𝐫𝐫𝐚𝐲𝐬.𝐬𝐨𝐫𝐭() 𝐚𝐧𝐝 𝐂𝐨𝐥𝐥𝐞𝐜𝐭𝐢𝐨𝐧𝐬.𝐬𝐨𝐫𝐭(). 👉𝐀𝐫𝐫𝐚𝐲𝐬.𝐬𝐨𝐫𝐭():-It sorts the arrays which can be the type of primitive data type. 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦:- Dual-Pivot Quicksort algorithm 𝐓𝐢𝐦𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: O(nlog(n))   𝐀𝐮𝐱𝐢𝐥𝐢𝐚𝐫𝐲 𝐒𝐩𝐚𝐜𝐞 : O(1) 👉 𝐂𝐨𝐥𝐥𝐞𝐜𝐭𝐢𝐨𝐧𝐬.𝐬𝐨𝐫𝐭():- It sort only the objects which extends List interface(ArrayList,LinkedList etc) or user-defind class objects if class implements Comparable.  𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦:- Adaptive Mergesort algorithm 𝐓𝐢𝐦𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: O(nlog(n))   𝐀𝐮𝐱𝐢𝐥𝐢𝐚𝐫𝐲 𝐒𝐩𝐚𝐜𝐞 : O(1) Examples:- ✅ Arrays.sort():- import java.util.Arrays; class ArraySort { public static void main(String arg[]){   int arr[] = {10,4,6,7,8};   Arrays.sort(arr); // {4,6,7,8,10}  } } ✅ Collections.sort():- import java.util.Collection; import java.util.List; class CollectionSort { public static void main(String arg[]){   List<Integer> arrList = List.of(11,5,6,3,2,8)   Collections.sort(arrList); // {2,3,5,6,8,11}  } } Follow @full_stack_geek 👨‍💻 for more interview questions. #java #corejava #java8 #springboot #backenddeveloper #fullstackdeveloper #javadeveloper #javaprogramming

@RareSkills_io Is there a leaderboard or Tweet thread for ArraySort? I want to see how my YUL insertion sort stacks up:

This article helped me understand Array.sort() function on a deeper level: dev.to/felix/understanding-s… quote: if the first string is "greater" (comes after in alphabetical order) than the second one, we return a positive value so that value1 is put after value2 #javascript #arraysort