Direct insertion and sorting of sorting algorithms (JAVA)

[Java] public class InsertSort {/*** inserts a data entry into sorted data, in this way, a new ordered data with a number plus one is obtained. * The time complexity is O (n ^ 2) * stable 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-1; I ++) {int j = I + 1; int temp = nums [j]; // The maximum number of inserted and sorted parts, that is, nums [I] is compared while (I >=0 & nums [I]> temp) {nums [j] = nums [I]; I --; j --;} nums [j] = temp ;}}}