BenBE

There's [Timsort](https://en.wikipedia.org/wiki/Timsort) and it's derived version [Powersort](https://en.wikipedia.org/wiki/Powersort) that are a combination of stable [Merge sort](https://en.wikipedia.org/wiki/Merge_sort) with basically insertion sort for small sub-arrays. So no, insertion sort won't be gone entirely,...

I'm currently looking into PowerSort, which is both stable AND a variant of merge sort. Also, it should be reasonable to implement its merging step in-place, leaving us with static...

I'm with you regarding memory usage of O(n), in particular with small arrays this introduces an overhead that's just going to cause performance issues due to how frequent we sort...

@zeneral Welcome. Yes. The issue is basically to rework the internal way sorting is performed and replace the two different interfaces by a single one. The requirements for the replacement...

@zeneral Take a look at d3cd557e0534a45ab971397d4c407116547d3f6d, which proposes the intended API for after the consolidation. Replace the implementation in `Vector_sort` by your variant and compare with a tool like `callgrind`¹+`kcachegrind`....

This looks kinda strange, as the exception seems to come directly from within the libc function itself. Looking at the string in uname: This is somehow missing the exact kernel...

Thank you for reporting this regression. I'll take a look at it.

Any particular question related to this build, or is this purely informational?

This PR has several issues, and one of them being down-voting of a good comment listing a few of the things that are wrong with this PR. Let's start: 1....

I did a quick test run to check for certain criteria of the interfaces, basically, what type they are, and if they have a parent interface assigned. A rough scetch...