Sort the best traces as we go using insertion sort instead of sorting the whole array each time

[romac]

See this thread for background information: #1465 (comment)

This might be completely overkill if n-traces is in practice less than a few thousands, but it was fun to write :) No worries if you'd rather not merge it because of that.

---

• Tests added for any new code
• Documentation added for any new functionality
• Entries added to the respective CHANGELOG.md for any new functionality
• Feature table on README.md updated for any listed functionality

[romac]

Here is a benchmark to compare the two approaches.

It looks like even with only 1k elements and a super cheap comparison function on integers this makes quite the difference:

[romac]

@bugarela Let me know if you want to move forward with this, and I will add a changelog entry. Otherwise, no problem :)

[bugarela]

@bugarela Let me know if you want to move forward with this, and I will add a changelog entry. Otherwise, no problem :)

I absolutely do! I haven't reviewed it since it is marked as a draft, but I can do it. Thank you for doing this!

[romac]

Ok great, I'll let you take care of the changelog then :)

[bugarela]

Awesome, thank you so much to taking care of this in such organization ✨