第六次作业上交~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~武汉加油！

1.定义长度位5的整型数组,输入他们的值,用冒泡排序后输出.

package kl;
import java.util.Scanner;
public class wwc {
            public static void main(String[] args) {
                // TODO Auto-generated method stub
                Scanner input=new Scanner(System.in);
                 System.out.println("输入数组的值：");
                 int[] arr= new int[5];
                 for(int i=0;i<arr.length;i++) {
                  arr[i]=input.nextInt();
                 }
                    for (int i = 0; i < arr.length-1; i++) {
                        for (int j = 0; j < arr.length-1-i; j++) {
                        if(arr[j] > arr[j+1]){
                            int t=arr[j];
                            arr[j]= arr[j+1];
                            arr[j+1] = t;
                         }
                      }
                    }
                    System.out.println("冒号排序为：");
                    for (int i=0;i<arr.length;i++) {
                        System.out.print(arr[i]+" ");
                    }
                }       
    }

 2.定义数组{34,22,35,67,45,66,12,33},输入一个数a,查找在数组中是否存在,如果存在,输出下标,不存在输出"not found"

package kl;
import java.util.Scanner;
public class wwc {
            public static void main(String[] args) {
                int arr[]= {34,22,35,67,45,66,12,33};
                Scanner input = new Scanner(System.in);
                System.out.println("请输入一个数a:");
                int b=input.nextInt();    
                boolean yes=false;
                for(int i=0;i<arr.length;i++) {
                    if(arr[i]==b) {
                        System.out.println("数的下标为:"+i);
                        yes=true;
                }                                        
                    }
                if(yes==false)
                    System.out.println("not found");              
                }  
}

 3.以矩阵的形式输出一个double型二维数组（长度分别为5、4，值自己设定）的值。

package kl;
import java.util.Scanner;
public class wwc {
            public static void main(String[] args) {
                // TODO Auto-generated method stub          
                 double[][]arr= {{1.1,1,1,1},{2.2,2,2,2},{3.3,3,3,3},{4.4,4,4,4},{5.5,5,5,5}};
                 for(int i=0;i<arr.length;i++) {
                     for(int j=0;j<arr.length-1;j++) {
                         System.out.print(arr[i][j]+"	");
                     }
                     System.out.println("");
                 }               
                }       
    }

 4.定义一个二维数组(长度分别为3,4,值自己设定),求该二维数组的最大值.

package kl;
import java.util.Scanner;
public class wwc {
            public static void main(String[] args) {
                // TODO Auto-generated method stub          
                 int[][]arr= {{1,2,3,4},{5,6,7,8},{9,8,7,6}};
                 int max=0;
                 for(int i=0;i<arr.length;i++) {
                     for(int j=0;j<arr.length-1;j++) {
                         if(arr[i][j]>max) {
                             max=arr[i][j];
                         }
                     }                    
                 }
                 System.out.println("最大值为:"+max);
                }       
    }