Selection Sort Swapping Strategy

The selectionSort method below implements a sorting algorithm. Which statement best describes the effect of its swapping strategy when compared to a classical selection sort?

public class OptimizedSelectionSort {
    public static void selectionSort(int[] arr) {
         for (int i = 0; i < arr.length - 1; i++) {
             int j = i + 1;
             while (j < arr.length) {
                 if (arr[i] > arr[j]) {
                     int temp = arr[i];
                     arr[i] = arr[j];
                     arr[j] = temp;
                 }
                 j++;
             }
         }
    }
}