Question about printing and sorting files

Question

What I'm trying to do is read in a file of names (about a thousand) sort them using a sort alorithim then print out the sorted file of names, as well a separate chart with the number of compares and swaps . My Sort class has different sorting algorithims, like insertion, bubble etc. Everything I have now works fine. But the way its set up now I have to pick one algorithim at a time, then it sorts then prints the results like this:
Bubble Sort
Compares : 2016
Swaps : 1052.
Now if I want to choose anothert algorithim, I'll have to manualy do that then run Main again then apend the results to the output file. But I would like run Main once opening the file that needs to be sorted then run one algorithim, calc the results, then do that again for another algorithim calc the results, then when I'm finished with all the algorithims, print all the results at once to the output chart. This so the output will look better, and the user won't have repeatedly run the program to see and compare the results.
Is this even possible, and if so, any ideas how?
This is the main console, which put the names in a array list, then sorts
them
public class SortyFile {
     public static void main(String[] args) throws IOException{
           BufferedReader r = new BufferedReader(new FileReader("C:/Documents and Settings/Cougar/" +
               "Desktop/names.txt"));
           PrintWriter Output_Chart
                = new PrintWriter(new BufferedWriter(new FileWriter("C:/Documents and Settings/Cougar/" +
                  "Desktop/Output Chart2.txt" , true)));
           PrintWriter Output_Sorted_File
                = new PrintWriter(new BufferedWriter(new FileWriter("C:/Documents and Settings/Cougar/" +
                       "Desktop/Sorted File2.txt")));
           ArrayList a = new ArrayList();
           String line = null;
           while ((line = r.readLine()) != null)
                a.add(line);
                Sort.bubbleSort(a);
              Output_Chart.println("");
              Output_Chart.println(Sort.algoname);
              Output_Chart.println("");
              Output_Chart.println("Compares :" + "   " + Sort.compares);
              Output_Chart.println("Swaps :" + "      "  + Sort.swaps);
              Output_Chart.println("");
              for (int i=0; i<a.size(); i++){
                   Output_Sorted_File.println(a.get(i));
                   System.out.println(a.get(i));
           Output_Chart.close();
           Output_Sorted_File.close();
This is the class with different sorting algorithims, the variable algoname is use for printing the header on the output chart.
public class Sort {
    static int swaps = 0;
    static int compares = 0;
    static String algoname;  // name for the algorithim
    public static void swap(List data, int least, int i) {
          Object tmp = data.get(least);
          data.set(least, data.get(i));
          data.set(i, tmp);
     public static void bubbleSort(List data)
        for (int i = 0; i < data.size(); i++)
            for(int j = i+1; j < data.size(); j++)
                Comparable current = (Comparable) data.get(j);
                Comparable previous = (Comparable) data.get(i);
                compares++;
                if (current.compareTo(previous) < 0)
                    data.set(j, previous);
                    data.set(i, current);
                    swaps++;
        algoname = "Bubble Sort"; 
      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++;     
             if (((((Comparable) (data.get(j))).compareTo(data.get(least)))) < 0)
                  least = j;
                  swap(data,least,i);
                  swaps++;
           algoname = "Selection Sort";
      public static void insertionSort (List data)
             Comparable tmp;
          int i, j;
             for(i = 1; i < data.size(); i++)
                  tmp =  (Comparable)data.get(i);
                   for(j = i; (j > 0) && (tmp.compareTo(data.get(j - 1)) < 0) ; j--){
                   compares++;
                   data.set(j, data.get(j - 1))  ;
                   data.set(j, tmp)  ;
                  swaps++;
             algoname = "Insertion Sort";
}

Answer 1

Maybe Im misunderstanding your question, but couldnt
you just run the bubbleSort() method, then the
insertionSort() method, and so on? You would do this
in your main method.Yeah I tried that but for odd reason I get this for the results
Bubble Sort
Compares : 2016
Swaps : 1052
Selection Sort
Compares : 2016
Swaps : 1052
The results for both algorthims are exactly the same.