Swap Counter in simple Selection Sort method

Question

    void sortSelection(List object)
         int swapCount=0;
           for(int i = list.length; i >= 2; i--)
             int maxIndex = 0;
                    for(int j = 1; j < i; j++)
                         if(list[j] > list[maxIndex])
                              maxIndex = j;
               int temp = list[maxIndex];        //
               list[maxIndex] = list[i-1];         //         Is the problem here?        
               list[i-1] = temp;                     //
               swapCount++;                     //
          System.out.println("\n" +swapCount+ " swaps were needed. ");
    }This is a pretty simple selection sort method. But I am fairly sure that I am incorrectly counting swaps with the code. I have defined a "swap" as when two array indices have their values switched. I am convinced that there is something wrong because the array of numbers is randomly generated, and yet the swapCount counter is always equal
to (list.length-1) when it prints out. I would think it should be different every time. I indicated the line where I believe the problem lies, but I am not for sure. Thanks everybody.

Answer 1

List of Random Integers, then sorted:
9, 29, 30, 42, 53, 58, 59, 64, 66, 69, 74, 79, 79, 87, 95
9 swaps were needed.then sort again (descending) and get this:
95, 87, 79, 79, 74, 69, 66, 64, 59, 58, 53, 42, 30, 29, 9
1 swaps were needed.I'm pretty sure that isn't correct. But forgive me if I did not specify that it was to work in descending order as well.
So I tried this:
void sortSelection(List object)
         int swapCount=0;
           for(int i = list.length; i >= 2; i--)
             int maxIndex = 0;
                    for(int j = 1; j < i; j++)
                         if(list[j] > list[maxIndex])
                              maxIndex = j;
              if (maxIndex != (i-1) && ascending==true)
                   int temp = list[maxIndex];
                    list[maxIndex] = list[i-1];                             
                    list[i-1] = temp;   
                    swapCount++;
              else if (maxIndex != (i+1) && descending==true)
                   int temp = list[maxIndex];
                    list[maxIndex] = list[i-1];                             
                    list[i-1] = temp;   
                    swapCount++;
} adding the i+1 (because it is going in a different order)...and I think I solved it!