You are viewing a plain text version of this content. The canonical link for it is here.

Posted to commits@harmony.apache.org by "Imran Ghory (JIRA)" <ji...@apache.org> on 2007/08/22 21:56:31 UTC

[jira] Commented: (HARMONY-4669) BinarySearches in Arrays broken

    [ https://issues.apache.org/jira/browse/HARMONY-4669?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel#action_12521912 ] 

Imran Ghory commented on HARMONY-4669:
--------------------------------------

Merge sorts look broken as well

> BinarySearches in Arrays broken
> -------------------------------
>
>                 Key: HARMONY-4669
>                 URL: https://issues.apache.org/jira/browse/HARMONY-4669
>             Project: Harmony
>          Issue Type: Bug
>          Components: Classlib
>            Reporter: Imran Ghory
>
> All of the binary searches in Arrays.java use " mid = (low + high) >> 1;" to calculate the average (rather than >>>) so int overflow can result in incorrect mid values.

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.