Home » U++ Library support » U++ Core » Stable Sort algorithm
| Re: Stable Sort algorithm [message #61617 is a reply to message #61590] |
Mon, 24 March 2025 22:05   |
JeyCi
Messages: 69
Registered: July 2020
|
Member |
|
|
Didier wrote on Thu, 20 March 2025 19:48
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.
Best regards.
|
|
|
|
Current Time: Sat Jun 07 19:56:36 CEST 2025
Total time taken to generate the page: 0.03373 seconds
|
Members
Pages
Help
Register
Login
Home
