冒泡排序法

public static void main(String[] args) {
// TODO Auto-generated method stub
String strs ="jfhuadnuyronbd";

char [] chrs = strs.toCharArray();

for (int i = 0; i < chrs.length-1; i++) {

for (int j = 0; j < chrs.length-i-1; j++) {

if(chrs[j]>chrs[j+1]){

char c = chrs[j];
chrs[j]=chrs[j+1];
chrs[j+1]=c;
}
}
}System.out.println("排序后：");
for (int i = 0; i < chrs.length; i++) {
System.out.print(chrs[i]+" ");
}
}