public class Dome1 {
public static void main(String[] args) {
int[] arr = new int[]{3 ,9, 6, 1, 17,3,8,2,3,44,20,32};
//获取数组最大值,最小值
int max = 0,min=arr[0];
for (int i = 0; i < arr.length; i++) {
if (arr[i] > max) {
max = arr[i];
}
if(arr[i]<min){
min=arr[i];
}
}
System.out.println("数组的最大值为:" + max);
System.out.println("数组的最小值为:" + min);
//数组元素交换,例如索引为1和3进行交换
System.out.print("数组元素的交换:");
int tem=0;
tem=arr[1];
arr[1]=arr[3];
arr[3]=tem;
for (int num:arr) {
System.out.print(num+" ");
}
System.out.println();
//数组反转!!!!!!!
System.out.print("数组反转之后的结果为:");
for (int i=0,j = arr.length-1; i<j;i++, j--) {
int t=0;
t=arr[j];
arr[j]=arr[i];
arr[i]=t;
}
for (int num:arr) {
System.out.print(num+" ");
}
System.out.println();
//数组排序
System.out.print("数组排序升序:");
for (int i = 0; i < arr.length; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int n = 0;
n = arr[i];
arr[i] = arr[j];
arr[j] = n;
}
}
}
//冒泡排序
//打印
for (int num:arr) {
System.out.print(num+" ");
}
System.out.println();
//降序
System.out.print("数组排序降序:");
for (int i = 0; i < arr.length; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] < arr[j]) {
int n = 0;
n = arr[i];
arr[i] = arr[j];
arr[j] = n;
}
}
}
for (int num:arr) {
System.out.print(num+" ");
}
}
}
01-09
4601
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)