/*
- * Jalview - A Sequence Alignment Editor and Viewer
- * Copyright (C) 2007 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
- *
+ * Jalview - A Sequence Alignment Editor and Viewer (Version 2.4)
+ * Copyright (C) 2008 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
+ *
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
- *
+ *
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
- *
+ *
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
{
sort(arr, 0, arr.length - 1, s);
}
-
+
public static void sort(double[] arr, Object[] s)
{
sort(arr, 0, arr.length - 1, s);
sort(arr, q + 1, r, s);
}
}
+
public static void sort(double[] arr, int p, int r, Object[] s)
{
int q;
do
{
j = j - 1;
- }
- while (arr[j] > x);
+ } while (arr[j] > x);
do
{
i = i + 1;
- }
- while (arr[i] < x);
+ } while (arr[i] < x);
if (i < j)
{
do
{
j = j - 1;
- }
- while (arr[j] > x);
+ } while (arr[j] > x);
do
{
i = i + 1;
- }
- while (arr[i] < x);
+ } while (arr[i] < x);
if (i < j)
{
do
{
j = j - 1;
- }
- while (arr[j].compareTo(x) < 0);
+ } while (arr[j].compareTo(x) < 0);
do
{
i = i + 1;
- }
- while (arr[i].compareTo(x) > 0);
+ } while (arr[i].compareTo(x) > 0);
if (i < j)
{