1、一组乱序的字符序列m、b、p、f、a、u、z，请用冒泡排序算法，使之按字母表顺序排列
public class Homework1 {
public static void main(String[] args) {
char[] num= {'m','b','p','f','a','u','z'};
int len=num.length;
for (int i = 0; i < len-1; i++) {
boolean flag=false;// true交换 false不交换
for (int j = 0; j < len-i-1; j++) {
if(num[j]>num[j+1]) {
char temp=num[j];
num[j]=num[j+1];
num[j+1]=temp;
flag=true;
}
}
if(!flag) {
break;
}
}
for(char a:num) {
System.out.print(a+" ");
}
}
}
2、一组有序的字符序列a、b、c、e、f、p、u、z，向次字符序列中插入一个新的字符，要求插入之后字符序列仍保持有序
public class Homework2 {
public static void main(String[] args) {
char []num1= {'a','b','c','d','e','f','p','u','z'};
char n='k';
char []num2=new char[10];
int len=num2.length;
int index=len-1;
for (int i = 0; i < num1.length; i++) {
if(num1[i]
num2[i]=num1[i];
}else {
index=i;
break;
}
}
num2[index]=n;
for (int i = index; i < len-1; i++) {
num2[i+1]=num1[i];
}
for(char a : num2) {
System.out.print(a+" ");
}
}
}
3、 判断一个数组是否有序
public class Homework3 {
public static void main(String[] args) {
int[] num= {1,1,1,1,1,1};
int len=num.length;
boolean flag=true;
if(num[0]>num[len-1]) {
for (int i = 0; i < len; i++) {
if(num[i]
flag=false;
break;
}
}
}else {
for (int i = 1; i < len; i++) {
if(num[i]
flag=false;
break;
}
}
}
if(!flag) {
System.out.print("无序");
}else {
System.out.print("有序");
}
}
}
