harmony-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Andrew Zhang" <zhanghuang...@gmail.com>
Subject Re: [performance] quick sort is 4x slower on Harmony
Date Mon, 24 Dec 2007 04:36:04 GMT
On Dec 24, 2007 7:44 AM, Nathan Beyer <nbeyer@gmail.com> wrote:

> Can post the code that you're seeing this in? At least a
> representative example of the code would be needed to do any analysis.


Hi,

You can find code here:
http://zhanghuangzhu.blogspot.com/2007/12/quicksort-runs-slower-on-harmony.html


>
> -Nathan
>
> On Dec 22, 2007 11:35 AM, Andrew Zhang <zhanghuangzhu@gmail.com> wrote:
> > Hi,
> >
> > I just found quick sort is very slow (4x) on Harmony compared with RI. I
> > didn't mean Arrays.sort method here, but a stack based implementation of
> > quick sort. The code has a lot of push/pop operation. Any idea?
> >
> > --
> > Best regards,
> > Andrew Zhang
> >
> > http://zhanghuangzhu.blogspot.com/
> >
>



-- 
Best regards,
Andrew Zhang

db4o - database for Android: www.db4o.com
http://zhanghuangzhu.blogspot.com/

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message