Didier Messages: 725 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)
If you want to transform an unstable alogrithm into stable one, you just need to add data index comparison in you're comparison criteria.
as I remember, he took comparator from here. He is developing COM and uses sorting of pointers to memory - that is considered to be faster, but as Iknow, UPP IDE also works with stack and heap directly in its source-files, just hiding pointers to Core and other packages.
Didier Messages: 725 Registered: November 2008 Location: France
Contributor
Maybe my use case is close to that:
Sort an array of int based on sort criterias comming from data pointed by the index: sounds pretty close to sorting strings
If m'y memory is good, the upp::sort was 2 times faster than std::sort
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)
