JAVA数组学习之作业（Chapter06）

第六章作业–数组

4.已知有个升序的数组，要求插入一个元素，该数组仍是升序

/**

 * @author whj

 * @version 1.0

 */

//已知有个升序的数组，要求插入一个元素，该数组仍是升序

import java.util.Scanner;

public class HW4 {

	 public static void main(String[] args) {

	 	Scanner myScanner = new Scanner(System.in);

	 	int arr[] = {10, 12, 45, 90};

	 	int arr2[] = new int[arr.length + 1]; 

	 	System.out.println("请输入对应的元素:");

	 	int num = myScanner.nextInt();

	 	int index = -1;

	 	for (int i = 0; i < arr.length ; i++) {

	 		if (arr[i] >= num) {

	 			index = i;

	 			break;

	 	}

	 	if (index == -1) {

	 		index = arr.length;		
	 	}

	 	for (int i = 0, j = 0; i < arr2.length; i++) {

	 		if (i != index) {

	 			arr2[i] = arr[j];

	 			j++;

	 		} else {

	 			arr2[i] = num;

	 		}

	 		
	 	}

	 	arr = arr2;

	 	for (int i = 0; i < arr.length; i++) {

	 		System.out.print(arr[i] + "\t");

	 	}

	 	System.out.println();	
	}
}

5。随机生成1-100中的十个数字。倒叙打印并求平均值，求最大值、最小值的坐标，以及查找是否有8

/**
 * @quthor whj
 * @version 1.0
 */
public class HW5 {
	public static void main(String[] args) {
		int arr[] = new int[10];
		for (int i =0; i < arr.length; i++) {//生成 1-100的随机数字
			arr[i] = (int)(Math.random()* 100) +1;
		}
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + "\t");
		}
		System.out.println();
		for (int i = arr.length - 1; i >= 0; i--) {
			System.out.print(arr[i] + "\t");
		}
		System.out.println();		
		//寻找最大值的索引
		int index = 0;
		int max = arr[0];
		for (int i = 0; i<arr.length; i++) {
			if (max < arr[i]) {
				max = arr[i];
				index = i;
			}
		}
		System.out.println("最大值是" + max + "index = " + index);
		//打印平均值
		int sum = 0;
		for (int i = 0; i<arr.length; i++) {
			sum += arr[i];
		}
		double averageValue = (double)(sum) / arr.length;
		System.out.println("平均值是：" + averageValue);
		//查找是否有8
		boolean check = false;
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] == 8) {
				check = true;
			}
		}
		if (check == true) {
			System.out.println("有8");
		} else {
			System.out.println("无8");
		}
	}
}

6.判断输出

/**
 * @author whj
 * @version  1.0
 */
public class HW6 {
	public static void main(String[] args) {
		char[] arr1 = {'a', 'z', 'b', 'c'};
		char[] arr2 =arr1;
		arr1[2] = '韩';
		for (int i = 0; i < arr2.length; i++) {
			System.out.println(arr1[i] + "," + arr2[i]);
		}
	}
}

7.冒泡排序

//冒泡排序
/**
 * @author whj
 * @version 1.0
 */
//分析：
//1.声明一个数组，然后排序；
//2.排序第一轮：将最大的放在最后
//3.在剩下的n-1的数中将最大的放在最后；
//依次类推
public class HW7{
	public static void main(String[] args) {
		int arr[] ={1, 3, 543, 32, 242, 243, 5, 42, 12, 20};
		int temp = 0;
		for (int j = 1; j < arr.length ; j++) {
			for (int i = 0; i < arr.length - j; i++) {
			 	if (arr[i] > arr[i + 1]) {
			 		temp = arr[i];
			 		arr[i] = arr[i + 1];
			 		arr[i + 1] = temp;
			 	}
			 } 	
		}
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i] + "\t");
		}
		System.out.println();
	}
}