Bubble Sorting Algorithm

Compare adjacent elements. If the first element is larger than the second one, exchange the two of them and perform the same work on each adjacent element, starting from the first pair to the last one at the end, at this point, the final element should be the largest number. Repeat the above steps for all elements except the last one, continue to repeat the above steps for fewer and fewer elements until there is no need to compare a pair of numbers (compare Adjacent Elements from start to end, matching the switching order)

Int [] array = new int [*]; int temp = 0; For (INT I = 0; I <array. length-1; I ++) {for (Int J = I + 1; j <array. length; j ++) {If (array [J] <array [I]) {temp = array [I]; array [I] <array [J]; array [J] = temp ;}}}