Re: [Exist-development] Sorting problem

[Dmitriy S. <sha...@gm...>]

We need a stable one!

On Mon, Feb 22, 2010 at 3:05 PM, Adam Retter <ad...@ex...> wrote:

> How does the performance of Arrays.sort compare to Quicksort?
>
> If it is not favourable, perhaps we need to identify a better
> alternative algorithm?
>
> On 21 February 2010 08:05, Dmitriy Shabanov <sha...@gm...> wrote:
> > Hello,
> >
> > We use Quicksort algorithm for sorting. It's not stable
> > (
> http://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms )
> >
> > Example:
> >
> http://sourceforge.net/tracker/?func=detail&aid=2903818&group_id=17691&atid=117691
> >
> > I think better to switch to Arrays.sort .
> >
> > --
> > Cheers,
> >
> > Dmitriy Shabanov
> >
> >
> ------------------------------------------------------------------------------
> > Download Intel&#174; Parallel Studio Eval
> > Try the new software tools for yourself. Speed compiling, find bugs
> > proactively, and fine-tune applications for parallel performance.
> > See why Intel Parallel Studio got high marks during beta.
> > http://p.sf.net/sfu/intel-sw-dev
> > _______________________________________________
> > Exist-development mailing list
> > Exi...@li...
> > https://lists.sourceforge.net/lists/listinfo/exist-development
> >
> >
>
>
>
> --
> Adam Retter
>
> eXist Developer
> { United Kingdom }
> ad...@ex...
> irc://irc.freenode.net/existdb
>



-- 
Dmitriy Shabanov