[Java] common Java sorting algorithms

/***** @ Author Loger **/public class sort {/*** select sorting * @ Param array * @ return */Public int [] selectsort (INT array []) {int out, in; int min; For (out = 0; out <array. length-1; out ++) {min = out; for (in = out + 1; in <array. length; In ++) {If (array [in] <array [Min]) {min = in ;}} if (Min! = Out) {array [out] = array [out] + array [Min]; array [Min] = array [out]-array [Min]; array [out] = array [out]-array [Min] ;}} return array ;} /*** bubble sort ** @ Param array * @ return */Public int [] bubblesort (INT array []) {for (INT I = 0; I <array. length-1; I ++) {for (Int J = I; j <array. length-i-1; j ++) {If (array [J]> array [J + 1]) {array [J] = array [J] + array [J + 1]; array [J + 1] = array [J]-array [J + 1]; array [J] = array [J]-array [J + 1] ;}} return array;}/**** insert sorting * @ Param array * @ return */Public int [] insertsort (INT array []) {for (INT I = 1; I <array. length; I ++) {int insert = array [I]; // The element to be inserted Int J = I-1; while (j> = 0 & Insert <array [J]) {array [J + 1] = array [J]; j --;} array [J + 1] = insert;} return array;}/*** main function * @ Param ARGs */public static void main (string [] ARGs) {// todo auto-generated method stubint [] array = {1, 3, 2, 9, 8, 7, 10}; sort = new sort (); system. out. println ("original array:"); For (int A: array) {system. out. print (a + "");} // system. out. println ("\ n select sorting:"); // For (int A: sort. selectsort (array) {// foreach prints the array // system. out. print (a + ""); //} // system. out. println ("\ n Bubble Sorting:"); // For (int A: sort. bubblesort (array) {// foreach prints the array // system. out. print (a + ""); //} system. out. println ("\ n insert sorting:"); For (int A: sort. insertsort (array) {// foreach prints the array system. out. print (a + "");}}}