Bubble Sorting by sorting algorithm (JAVA)

[Java] public class BubbleSort {/*** because the sorting process always places a decimal number forward and a large number backward, it is equivalent to a bubble rising, so it is called a Bubble sorting. * Time Complexity: O (n ^ 2) * stable sorting mode * @ param nums array to be sorted * @ return output ordered array */public static void sort (int [] nums) {boolean isChanged; for (int I = 0; I <nums. length; I ++) {isChanged = false; // if a large element is found, move it back for (int j = 0; j <nums. length-i-1; j ++) {if (nums [j]> nums [j + 1]) {int temp = nums [j + 1]; nums [j + 1] = nums [j]; nums [j] = temp; isChanged = true ;}// if not moved, the sequence is ordered, jump out of the loop if (! IsChanged) {break ;}}}}