数组升降序
kage text02;
import java.util.Arrays;
public class demo07 {
public static void main(String[] args) { String [] name=new String[] {“a” ,“c” ,“u” ,“b” ,“e” ,“p” ,“s” ,“f” ,“z”} ;
System.out.print(“原字符序列:”);
for (int i = 0; i < name.length; i++) { System.out.print(name[i]+" “); } Arrays.sort(name);
System.out.print(“排列后的序列为:”); for (int t = 0; t < name.length; t++) { System.out.print(name[t]+” “); } System.out.println(“排列后的逆序为:”); for (int j=name.length-1; j >= 0; j–) { System.out.print(name[j]+” "); }
}
}