U++ framework
Do not panic. Ask here before giving up.

Home » U++ Library support » U++ Core » Stable Sort algorithm
Re: Stable Sort algorithm [message #61590 is a reply to message #61477] Thu, 20 March 2025 19:48 Go to previous messageGo to previous message
Didier is currently offline  Didier
Messages: 740
Registered: November 2008
Location: France
Contributor
Recently I had challenged sort algorithms: Upp, Std, other ...And Upp sorts were the fastest Smile (at least for my use-case)

If you want to transform an unstable alogrithm into stable one, you just need to add data index comparison in you're comparison criteria.
I tried it with Upp sort, and it was faster than stable sort Question (for my use case were there where the comparison criteria was quite complex)
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: SSL.h
Next Topic: Adding GetCount/NumBytes to Buffer?
Goto Forum:
  


Current Time: Tue Jun 16 08:24:47 GMT+2 2026

Total time taken to generate the page: 0.00466 seconds