第四章课后题-冒泡排序以及返回索引

package cc.openhome;
import java.util.Random;
public class Test {
    public static void main(String[] args) {
     int[] number={70,80,31,37,10,1,48,60,33,80};
     int max;
     //int[] result=new int[number.length];
    // int buk;
     for(int i=1;i<number.length;i++)
     for(int j=0;j<number.length-i;j++)
     {
         if(number[j]>number[j+1])
         { 
             max=number[j];
             number[j]=number[j+1];
             number[j+1]=max;
         }
     }
   for(int i=0;i<number.length
           ;i++)
   {
       System.out.printf("%d ",number[i]);

   }
   }
}

package cc.openhome;
import java.util.Scanner;
public class Test {
    public static void main(String[] args) {
     int[] number={1,10,31,33,37,48,60,70,80};
     Scanner sc= new Scanner(System.in);

     for(int num:number)System.out.printf(" %d",num);
        int abc=sc.nextInt();
     for(int i=0;i<number.length;i++)
     {
         if(abc==number[i])
         {
             System.out.printf("这个值是第%d个",i+1
             );
         }
         else{
             if(i==number.length-1)
             {
                 System.out.println("-1");
             }
         }
     }