1,冒泡排序
package NiuAlgorithm.Sort;
public class BubbleSort {
/*
* 6 3 5 7 0 4 1 2
* */
public static String bubbleSort (String string) {
String str[] = string.split(",");
for (int i = 0; i < str.length-1; i++) {
for (int j = 0; j < str.length-1-i; j++) {
if (Integer.valueOf(str[j]) > Integer.valueOf(str[j+1])) {
String temp = str[j];
str[j] = str[j+1];
str[j+1] = temp;
}
}
}
StringBuilder stringBuilder = new StringBuilder();
for (String val :
str) {
stringBuilder.append(val);
}
return stringBuilder.toString();
}
// 测试
public static void main(String[] args) {
String string = "6,3,5,7,0,4,1,2";
string = bubbleSort(string);
System.out.println(string);
}
}
2,选择排序
package NiuAlgorithm.Sort;
public class SelectSort {
public static String selectSort(String s){
String[] str = s.split(",");
for (int i = 0; i < str.length; i++) {
for (int j = i; j < str.length; j++) {
if (Integer.valueOf(str[i]) > Integer.valueOf(str[j])) {
String temp = str[i];
str[i] = str[j];
str[j] = temp;
}
}
}
StringBuilder stringBuilder = new StringBuilder();
for (String val :
str) {
stringBuilder.append(val);
}
return stringBuilder.toString();
}
//测试
public static void main(String[] args) {
String string = "6,3,5,7,0,4,1,2";
string = selectSort(string);
System.out.println(string);
}
}
3,插入排序
package NiuAlgorithm.Sort;
public class InsertSort {
public static String insertSort(String s) {
String[] str = s.split(",");
for (int i = 1; i < str.length; i++) {
for (int j = 0; j < i; j++) {
if (Integer.valueOf(str[j]) > Integer.valueOf(str[i])) {
String temp = str[j];
str[j] = str[i];
str[i] = temp;
}
}
}
StringBuilder stringBuilder = new StringBuilder();
for (String val :
str) {
stringBuilder.append(val);
}
return stringBuilder.toString();
}
public static void main(String[] args) {
String string = "6,5,3,1,8,7,2,4";
string = insertSort(string);
System.out.println(string);
}
}