Problems analizing compares and swaps in my algorithims

Question

What I need to do is analize my sorting algorthims, in terms of the number of compares and swaps. I have about 6 different sorts in one class, a couple of them came from help by, other posters, on this board. And I have a simple file reader in another class that reads a txt file, sorts, then prints, but also prints the numbers of compares, swaps, using varibles from my sorting class.
The txt file has 64 strings(names of people). Some of the sort I get what seems to me correct, or least close to correct results, but for a couple I"m getting downright strange results. I'm trying to figure out where to put the counting variables so I can get decent results.
In my quicksort, the results I'm getting is 1 compares 1 swaps, now obviously that's wrong but I'm trying to figure out where to put, the variables to get the correct results.
     public static void quicksort(List data, int first, int last){
                       int lower = first + 1, upper = last;
                       swap(data,first,(first+last)/2);
                       Comparable Bound = (Comparable)data.get(first);
                       while (lower <= upper){
                            while ((((Comparable)data.get(lower)).compareTo(Bound)) < 0)
                                      lower++;
                            while (Bound.compareTo(data.get(upper)) < 0)
                                 upper--;
                            if (lower < upper)
                                 swap(data,lower++,upper--);
                            else lower++;
                       swap(data,upper,first);
                       if (first < upper-1)
                            quicksort(data,first,upper-1);
                       if (upper+1 < last)
                            quicksort(data,upper+1,last);
      public static void quicksort(List data){
                       if (data.size() < 2)
                            return;
                       int max = 0;
                       //find largest data and put at end of data
                       for (int i = 1; i < data.size(); i ++)
                            if (((((Comparable) 
                       data.get(max)).compareTo(data.get(i))) < 0))
                                 max = i;
                       compares++;       // <----------------------- COMPARE
                       swap(data,data.size()-1,max);
                       swaps++;                 //    <--------------------------   SWAP
                       quicksort(data,0,data.size()-2);
}      The selection sort results give me exactly the same for both compares, and swaps 2016.
public static void selectionSort (List data)
           int i,j, least;
           final int size = data.size();
           for (i = 0; i < size - 1; i++)
              for (j = i+1, least = i; j < size; j++)
                   compares++;             //   <-------------------- COMPARE
             if (((((Comparable) (data.get(j))).compareTo(data.get(least)))) < 0)
                  least = j;
                  swap(data,least,i);
                  swaps++;                         //   <------------------------ SWAP
        Thanks for your help.

Answer 1

jkc532 wrote:
.. Is the fact that the CachedJarFile class doesn't attempt to reload the resource when it can't retrieve it from MemoryCache a bug? From your comprehensive investigation and report, it seems so to me.
..I've dug as deep as I can on this and I'm at wits end, does anybody have any ideas?Just after read the summary I was tired, so I have some understanding of the effort you have already invested in this (the 'wits' you have already spent). I think you should raise a bug report and seek Oracle's response.