X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Futil%2FQuickSort.java;h=80734f791b5d7e7d2af287c6b481ad02da83186e;hb=92f2bdf5a7a89ceefe2bff76ca75414cf0fb633c;hp=f81056ae748f8dca6dd6dd2654e1887792b130c8;hpb=1ecf6419aba86993b3c223bf5ec0fa79427baf85;p=jalview.git

diff --git a/src/jalview/util/QuickSort.java b/src/jalview/util/QuickSort.java
index f81056a..80734f7 100755
--- a/src/jalview/util/QuickSort.java
+++ b/src/jalview/util/QuickSort.java
@@ -1,51 +1,81 @@
+/*
+ * Jalview - A Sequence Alignment Editor and Viewer
+ * Copyright (C) 2005 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
+ */
 package jalview.util;
 
-
-public class QuickSort {
-
-  public static void sort(float[] arr,Object[] s) {
-    sort(arr,0,arr.length-1,s);
+public class QuickSort
+{
+  public static void sort(float[] arr, Object[] s)
+  {
+    sort(arr, 0, arr.length - 1, s);
   }
 
-  public static void sort(String[] arr,Object[] s) {
-    stringSort(arr,0,arr.length-1,s);
+  public static void sort(String[] arr, Object[] s)
+  {
+    stringSort(arr, 0, arr.length - 1, s);
   }
 
-  public static void stringSort(String[] arr,int p, int r,Object[] s) {
+  public static void stringSort(String[] arr, int p, int r, Object[] s)
+  {
     int q;
 
-    if (p < r) {
-      q = stringPartition(arr,p,r,s);
-      stringSort(arr,p,q,s);
-      stringSort(arr,q+1,r,s);
+    if (p < r)
+    {
+      q = stringPartition(arr, p, r, s);
+      stringSort(arr, p, q, s);
+      stringSort(arr, q + 1, r, s);
     }
   }
 
-  public static void sort(float[] arr,int p, int r,Object[] s) {
+  public static void sort(float[] arr, int p, int r, Object[] s)
+  {
     int q;
 
-    if (p < r) {
-      q = partition(arr,p,r,s);
-      sort(arr,p,q,s);
-      sort(arr,q+1,r,s);
+    if (p < r)
+    {
+      q = partition(arr, p, r, s);
+      sort(arr, p, q, s);
+      sort(arr, q + 1, r, s);
     }
   }
 
-  private static int partition(float[] arr, int p, int r,Object[] s) {
+  private static int partition(float[] arr, int p, int r, Object[] s)
+  {
     float x = arr[p];
-    int i = p-1;
-    int j = r+1;
-
-    while(true) {
-      do {
-        j = j-1;
-      }	while (arr[j] > x);
+    int i = p - 1;
+    int j = r + 1;
+
+    while (true)
+    {
+      do
+      {
+        j = j - 1;
+      }
+      while (arr[j] > x);
 
-      do {
-        i = i+1;
-      } while (arr[i] < x);
+      do
+      {
+        i = i + 1;
+      }
+      while (arr[i] < x);
 
-      if ( i < j) {
+      if (i < j)
+      {
         float tmp = arr[i];
         arr[i] = arr[j];
         arr[j] = tmp;
@@ -53,26 +83,36 @@ public class QuickSort {
         Object tmp2 = s[i];
         s[i] = s[j];
         s[j] = tmp2;
-      } else {
+      }
+      else
+      {
         return j;
       }
     }
   }
-  private static int stringPartition(String[] arr, int p, int r,Object[] s) {
-    String x = arr[p];
-    int i = p-1;
-    int j = r+1;
 
-    while(true) {
-      do {
-        j = j-1;
-      }	while (arr[j].compareTo(x) < 0);
+  private static int stringPartition(String[] arr, int p, int r, Object[] s)
+  {
+    String x = arr[p];
+    int i = p - 1;
+    int j = r + 1;
+
+    while (true)
+    {
+      do
+      {
+        j = j - 1;
+      }
+      while (arr[j].compareTo(x) < 0);
 
-      do {
-        i = i+1;
-      } while (arr[i].compareTo(x) > 0);
+      do
+      {
+        i = i + 1;
+      }
+      while (arr[i].compareTo(x) > 0);
 
-      if ( i < j) {
+      if (i < j)
+      {
         String tmp = arr[i];
         arr[i] = arr[j];
         arr[j] = tmp;
@@ -80,12 +120,11 @@ public class QuickSort {
         Object tmp2 = s[i];
         s[i] = s[j];
         s[j] = tmp2;
-      } else {
+      }
+      else
+      {
         return j;
       }
     }
   }
 }
-
-
-