summaryrefslogtreecommitdiff
path: root/libjava/classpath/java
diff options
context:
space:
mode:
authortromey <tromey@138bc75d-0d04-0410-961f-82ee72b054a4>2007-04-23 16:15:51 +0000
committertromey <tromey@138bc75d-0d04-0410-961f-82ee72b054a4>2007-04-23 16:15:51 +0000
commit68e6f1c34e43f9ac799a2a5c467e0bdd7138997a (patch)
tree4de9b3c5c0b23e1808441d9b39f4283da6d7c821 /libjava/classpath/java
parent238270c659d483108897274b3a160c382ec915c9 (diff)
downloadgcc-68e6f1c34e43f9ac799a2a5c467e0bdd7138997a.tar.gz
2007-04-23 Jeroen Frijters <jeroen@frijters.net>
PR classpath/31646: * java/util/Arrays.java (qsort): Corrected initial median calculation. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@124071 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libjava/classpath/java')
-rw-r--r--libjava/classpath/java/util/Arrays.java14
1 files changed, 7 insertions, 7 deletions
diff --git a/libjava/classpath/java/util/Arrays.java b/libjava/classpath/java/util/Arrays.java
index 72314243785..41e80455104 100644
--- a/libjava/classpath/java/util/Arrays.java
+++ b/libjava/classpath/java/util/Arrays.java
@@ -1040,7 +1040,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;
@@ -1204,7 +1204,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;
@@ -1368,7 +1368,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;
@@ -1544,7 +1544,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;
@@ -1720,7 +1720,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;
@@ -1890,7 +1890,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;
@@ -2060,7 +2060,7 @@ public class Arrays
}
// Determine a good median element.
- int mid = count / 2;
+ int mid = from + count / 2;
int lo = from;
int hi = from + count - 1;