java一维数组练习

package com.imooc;

public class Test {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	//定义一个数组，并遍历
	//找出最大最小值
	//重新排列数组（从大到小）
	//重新排列数组（从小到大）
	//数组元素交换位置
	int [] arr1={1,200,4,34,5,23,67,100,23,22,2,3,89};
	printout(arr1);
	max(arr1);	
	min(arr1);
	System.out.println(max(arr1));
	System.out.println(min(arr1));
	sort1(arr1);
	printout(arr1);
	sort2(arr1);
	printout(arr1);
	int [] arr2={1,200,4,34,5,23,67,100,23,22,2,3,89,9};
	swap(arr2);
	printout(arr2);

}

public static void printout(int [] arr){
	
	
	for(int i=0;i<arr.length;i++){
		if(i==0){
			System.out .print("int[] arr={"+arr[i]+",");
		}
		else if(i>0&&i<arr.length-1){
			System.out .print(arr[i]+",");
		}
		else System.out .print(arr[i]+"}");
			
	}
	System.out .println("");
}

public static int max(int [] arr1){
	int max=arr1[0];
	for(int i=0;i<arr1.length;i++){
		if(arr1[i]>max){
			max=arr1[i];
		}
	}
	return max;
}


public static int min(int [] arr1){
	int min=arr1[0];
	for(int i=1;i<arr1.length;i++){
		if(arr1[i]<min){
			min=arr1[i];
		}
	}
	return min;
}

public static int[] sort1(int [] arr1){
	int min=0;
	for(int i=0;i<arr1.length;i++){
		for(int j=0;j<arr1.length;j++){
			if(arr1[j]<arr1[i]){
				min=arr1[j];
				arr1[j]=arr1[i];
				arr1[i]=min;
			}
		}
	}
	return arr1;
}

public static int[] sort2(int [] arr1){
	int max=0;
	for(int i=0;i<arr1.length;i++){
		for(int j=0;j<arr1.length;j++){
			if(arr1[j]>arr1[i]){
				max=arr1[j];
				arr1[j]=arr1[i];
				arr1[i]=max;
			}
		}
	}
	return arr1;
}


public static int[] swap(int[] arr1){
	int temp=0;
	
	for(int i=0,j=arr1.length-1;i<j;i++,j--){
		temp=arr1[j];
		arr1[j]=arr1[i];
		arr1[i]=temp;
	}
	
	return arr1;
}

}