https://blog.csdn.net/euller/article/details/53330425
input: acdfbihg
outut :abcdfghi
import java.util.*;
/**
* @Author: yang
* @Date: 2018/8/27 19:04
*/
public class helloWorld2 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
char[] chs = str.toCharArray();
sortChar(chs);
String res = String.valueOf(chs);
System.out.println(res);
}
//冒泡排序
public static void sortChar(char[] chs){
for (int i = 0; i < chs.length; i++) {
for (int j = 0; j < chs.length - 1 -i; j++) {
if(chs[j] > chs[j+1]){
char tmp = chs[j];
chs[j] = chs[j+1];
chs[j+1] = tmp;
}
}
}
}
//选择排序算法
public static void xuanZeSort(char[] chs){
for(int i = 0; i < chs.length-1; i++){
for(int j = i+1; j<chs.length; j++){
if(chs[j] < chs[i]){
char temp = chs[j];
chs[j] = chs[i];
chs[i] = temp;
}
}
}
}
}