Sort by sorting algorithm (JAVA)

[Java] public class SelectSort {/*** each trip selects the smallest (or largest) element from the data element to be sorted, and places it at the end of the sorted series, until all data elements to be sorted are arranged. * Select sorting: Simple selection sorting, Tree Selection sorting (tournament sorting), and heap sorting. This algorithm is simple selection sorting * time complexity is O (n ^ 2) * unstable sorting method * @ param nums array to be sorted * @ return output ordered array */public static void sort (int [] nums) {for (int I = 0; I <nums. length; I ++) {int minIndex = I; for (int j = I + 1; j <nums. length; j ++) {if (nums [minIndex]> nums [j]) {minIndex = j ;}} if (minIndex! = I) {int temp = nums [I]; nums [I] = nums [minIndex]; nums [minIndex] = temp ;}}}}