Didier Messages: 728 Registered: November 2008 Location: France
Contributor
Recently I had challenged sort algorithms: Upp, Std, other ...And Upp sorts were the fastest (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 (for my use case were there where the comparison criteria was quite complex)
Members
Pages
Help
Register
Login
Home
(at least for my use-case)
(for my use case were there where the comparison criteria was quite complex)
