1 package maopaopaixu;
2
3 import java.util.Arrays;
4 import java.util.Scanner;
5
6 public class Demo02 {
7 public static void main(String[] args) {
8 Scanner sc=new Scanner(System.in);
9 int n=sc.nextInt();
10 char[] arr=new char[n];
11 for(int i=0;i<arr.length;i++){ //char的范围为0~65535
12 arr[i]=(char)(Math.random()*65535);
13 }
14 System.out.println("排序前:"+Arrays.toString(arr));
15
16 for(int i=0;i<arr.length;i++){
17 for (int j = 0; j < arr.length-1-i; j++) {
18 if(arr[j]>arr[j+1]){
19 char temp=arr[j];
20 arr[j]=arr[j+1];
21 arr[j+1]=temp;
22 }
23 }
24 }
25 System.out.println("排序后"+Arrays.toString(arr));
26 }
27 }
1 运行结果:
2 5
3 排序前:[♭, ㍳, 꺋, ౄ, 坐]
4 排序后[ౄ, ♭, ㍳, 坐, 꺋]