harmony-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Nathan Beyer" <nbe...@gmail.com>
Subject Re: [performance] quick sort is 4x slower on Harmony
Date Sun, 23 Dec 2007 23:44:15 GMT
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.

-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/
>

Mime
View raw message