上机作业
1.定义长度位5的整型数组,输入他们的值,用冒泡排序后输出.
package gr; import java.util.Scanner; public class hy { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input=new Scanner(System.in); System.out.println("输入数组的值:"); int[] a= new int[5]; for(int i=0;i<a.length;i++) { a[i]=input.nextInt(); } for (int i = 0; i < a.length-1; i++) { for (int j = 0; j < a.length-1-i; j++) { if(a[j] > a[j+1]){ int t=a[j]; a[j]= a[j+1]; a[j+1] = t; } } } System.out.println("冒号排序为:"); for (int i=0;i<a.length;i++) { System.out.println(a[i]+" "); } } }
2.定义数组{34,22,35,67,45,66,12,33},输入一个数a,查找在数组中是否存在,如果存在,输出下标,不存在输出"not found"
package gr; import java.util.Scanner; public class hy { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input=new Scanner(System.in); boolean c=false; int[] x=new int[]{34,22,35,67,45,66,12,33}; System.out.print("请输出一个数"); int a=input.nextInt(); for(int i=0;i<x.length;i++){ if(x[i]==a){ System.out.println("该数存在于数组中下标为"+i); c=true; } } if(c==false){ System.out.println("not found"); } } }
3.以矩阵的形式输出一个double型二维数组(长度分别为5、4,值自己设定)的值。
package gr; import java.util.Scanner; public class hy { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input = new Scanner(System.in); double[][]arr={{2,8,3,9},{8,4,6,7}, {11,22,88,66},{34,25,68,42}, {78,54,93,42}}; for(int i=0;i<arr.length;i++){ System.out.println(); for(int j=0;j<arr.length-1;j++){ System.out.print(arr[i][j]+" "); } } } }
4.定义一个二维数组(长度分别为3,4,值自己设定),求该二维数组的最大值.
package gr; public class hy { public static void main(String[] args) { // TODO Auto-generated method stub int [][]a={{87,36,89,54},{7,64,25,46},{58,12,49,62}}; int max=a[0][0]; for(int i=0;i<3;i++){ for(int j=0;j<4;j++){ if(a[i][j]>max){ max=a[i][j]; } } } System.out.println(max); } }