There is stable in-place merge sort [1], which is O(n*log(n)^2) and not that complex or hard to implement (about 80 lines, and that includes the ~15 lines of bi

There is stable in-place merge sort [1], which is O(n*log(n)^2) and not that complex or hard to implement (about 80 lines, and that includes the ~15 lines of binarySearch, which you might need anyway). [1] https://github.com/thomasmueller/bau-lang/blob/main/src/test/java/org/bau/stdlib/sort/MergeSort.java https://github.com/thomasmueller/bau-lang/blob/main/src/test...