U++ framework: U++ community news and announcements

Home » Community » U++ community news and announcements » Sort refactored

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

Sort refactored [message #36981]

Fri, 03 August 2012 19:20

mirek
Messages: 14291
Registered: November 2005

Ultimate Member

I have spent some time refactoring Sort algorithm, it should be now 15% - 30% faster and more resistant to "bad" input data (we are now using median of 3 and up to 2 partitioning reattempts with Random (mersene twister based) choice of new 3 elements to get the new pivot).

Report message to a moderator

Re: Sort refactored [message #37145 is a reply to message #36981]

Wed, 29 August 2012 18:06

mirek
Messages: 14291
Registered: November 2005

Ultimate Member

I have found that actual implementation does not behave well (is slow) when there are many duplicate values in the array; it should be now fixed by using "3-partition method" (introducing pivot partition of elements with the same value).

Report message to a moderator

Previous Topic:	Increased stack size for MSC in Core
Next Topic:	X11 menu focus trouble

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 09 07:33:45 GMT+2 2026

Total time taken to generate the page: 0.00809 seconds