Facebook
From Abrupt Crane, 4 Years ago, written in Plain Text.
Embed
Download Paste or View Raw
Hits: 211
  1. private static void qs(int items[], int left, int right)
  2.   {
  3.     int i, j;
  4.     int x, y;
  5.     i = left; j = right;
  6.     x = items[(left+right)/2];
  7.     do {
  8.       while((items[i] < x) && (i < right)) i++;
  9.       while((x < items[j]) && (j > left)) j--;
  10.       if(i <= j) {
  11.         y = items[i];
  12.         items[i] = items[j];
  13.         items[j] = y;
  14.         i++; j--;
  15.       }
  16.     } while(i <= j);
  17.     if(left < j) qs(items, left, j);
  18.     if(i < right) qs(items, i, right);
  19.   }