U++ framework: U++ Core » Stable Sort algorithm

Home » U++ Library support » U++ Core » Stable Sort algorithm

Show: Today's Messages :: Polls :: Message Navigator
E-mail to friend

Re: Stable Sort algorithm [message #61590 is a reply to message #61477]

Thu, 20 March 2025 19:48

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)

Report message to a moderator

[Message index]

		Stable Sort algorithm By: forlano on Thu, 20 February 2025 17:01
		Re: Stable Sort algorithm By: koldo on Thu, 20 February 2025 17:24
		Re: Stable Sort algorithm By: JeyCi on Thu, 20 March 2025 07:28
		Re: Stable Sort algorithm By: Didier on Thu, 20 March 2025 19:48
		Re: Stable Sort algorithm By: JeyCi on Mon, 24 March 2025 22:05
		Re: Stable Sort algorithm By: mirek on Fri, 18 April 2025 14:19
		Re: Stable Sort algorithm By: Didier on Sun, 20 April 2025 19:50

Previous Topic:	SSL.h
Next Topic:	Adding GetCount/NumBytes to Buffer?

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

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

Total time taken to generate the page: 0.00466 seconds