Robust/src/Tests/Prefetch/QuickSort.java

   1 public class QuickSort {
   2         public QuickSort() {
   3         }
   4
   5         public void quick_srt(int array[],int low, int n){
   6                 int lo = low;
   7                 int hi = n;
   8                 if (lo >= n) {
   9                         return;
  10                 }
  11                 int mid = array[(lo + hi) / 2];
  12                 while (lo < hi) {
  13                         while (lo<hi && array[lo] < mid) {
  14                                 lo++;
  15                         }
  16                         while (lo<hi && array[hi] > mid) {
  17                                 hi--;
  18                         }
  19                         if (lo < hi) {
  20                                 int T = array[lo];
  21                                 array[lo] = array[hi];
  22                                 array[hi] = T;
  23                         }
  24                 }
  25                 if (hi < lo) {
  26                         int T = hi;
  27                         hi = lo;
  28                         lo = T;
  29                 }
  30                 quick_srt(array, low, lo);
  31                 if(lo == low) {
  32                         low = lo+1;
  33                 }
  34                 else {
  35                         low = lo;
  36                 }
  37                 quick_srt(array, low, n);
  38         }
  39
  40         public static void main(String[] args) {
  41                 int i;
  42                 int j;
  43                 QArray myArray[] = new QArray[2];
  44                 myArray[0] = new QArray();
  45                 myArray[1] = new QArray();
  46                 QuickSort qsort = new QuickSort();
  47                 System.printString("Values Before sorting\n");
  48                 for(i = 0; i<2; i++){
  49                         for(j = 0; j<10; j++){
  50                                 System.printInt(myArray[i].mya[j]);
  51                                 System.printString("\t");
  52                         }
  53                         System.printString("\n");
  54                 }
  55                 for(i = 0; i<2; i++){
  56                         qsort.quick_srt(myArray[i].mya, 0, 9);
  57                 }
  58                 System.printString("Values After sorting\n");
  59                 for(i = 0; i<2; i++){
  60                         for(j = 0; j<10; j++){
  61                                 System.printInt(myArray[i].mya[j]);
  62                                 System.printString("\t");
  63                         }
  64                         System.printString("\n");
  65                 }
  66                 System.printString("\n");
  67         }
  68 }
  69
  70 public class QArray {
  71         public int mya[];
  72         public QArray() {
  73                 mya = new int[10];
  74                 mya[0] = 65;
  75                 mya[1] = 26;
  76                 mya[2] = 5;
  77                 mya[3] = 49;
  78                 for(int i = 4; i<9; i++)
  79                         mya[i] = 10*i;
  80                 mya[9] = 72;
  81         }
  82 }