数组与冒泡排序

package shuzu;

import java.util.Arrays;

public class ssss {

    public static void main(String[] args) {
        
        //一维数组
        
        int myarry [] = new int [5];
        
        //索引从0开始
        
        myarry[0] = 100;
      
        myarry[2] = 200;
         
        for(int i =0; i<myarry.length;i++)
        {
            System.out.println("myarry=" + myarry [i]);
        }
        
          //第二种方式,初始化数组，遍历
         
         int my[]  =new int [] {0,1,2,3,4};                     

            for(int i =0; i<my.length;i++)
            {
                System.out.println("my=" + my [i]);
            }
        
            //第三种方式
            
            
            char [] csz = new char [5];
            
            csz [0] =    'f';
            
            double [] dsz = {1,2,3};
            
            long lsz [] = new long [ ] {1,3,5,4};
            
            long l =lsz [2];
            
            //操作数组
            Arrays.sort(lsz );    //排序
            
            //遍历  while 循环
            
            int i =0;
            
            while (i<lsz.length)
            {
               System.out.println("lsz [" + i + "] = "+ lsz[i]);
               i++;
                Arrays.sort(lsz );    //排序
            }
            //复制数组
            
            long [] lsz2 =lsz;
            long [] lsz3 =Arrays.copyOf(lsz,2);
            long [] lsz4 =Arrays.copyOfRange(lsz,1,3);
            
            //查询数组,返回索引值，如果么有找到返回负数，可以判断是否包含某元素
        
            System.out.println("8的索引位置=" +Arrays.binarySearch(lsz,8));
            
            //填充
            Arrays.fill(lsz2,2);
            Arrays.fill(lsz3,1, 3, 8);
            
            
            //foreach语句
            
            for (double d :dsz)
            {
                System.out.println("d=" + d);
            }
            
            //二维数组
            
            int [] [] ewsz = new int [2] [3];
            
            ewsz [0] = new int [] {1,2,3};
            ewsz [1] = new int [] {4,5,6};
            
            System.out.println("ewsz=" + ewsz [1] [2]);
            
            System.out.println("ewsz=" + ewsz .length);
            
            for (int [] ie : ewsz)                                                    //foreach循环
            { 
                for (int f : ie)
                {
                    System.out.print( f +" ");
                }
                System.out.println();
            }
            
            for (int m = 0; m < ewsz.length;m++)                     //for循环
            {
                for (int n =0; n< ewsz [m].length; n++)
                {
                    System.out.print("" +ewsz [m] [n]);
                }
                System.out.println();
            }
            
            long [] [] lesz = new long [2] [];
            
            lesz [0] = new long [] {1,5};
            lesz [1] = new long [] {2,3,4,5,};
            
            for (int m = 0; m < lesz.length;m++)                     //for循环
            {
                for (int n =0; n< lesz [m].length; n++)
                {
                    System.out.print("" +lesz [m] [n]);
                }
                System.out.println();
            }
            
            
            
        

    }

}

package maopao;

public class xxx {

    public static void main(String[] args) {
        
        //冒泡排序
        
        int [] sz = {23,12,56,97,19,30,7,21};
        
        for (int i : sz)
        {
            System.out.print(i +",");
        }
        System.out.println();
        for (int j =1;j<sz.length;j++)
        {
            for (int i =0; i<sz.length - j; i++)
            {
                //可以改变序列方式
                if (sz [i] > sz [i+1])
                {
                    int t = sz [i+1];
                    sz [i+1] =sz [i];
                    sz [i] =t;
                }
            }
            }
        
        
        for (int i : sz)
        {
            System.out.print(i +",");
        }
        System.out.println();
    
    }

}