[Java] Array－睡る睡る

陣列

具有相同資料型態 (Data Type) 的元素，所組成的有序集合 (Ordered Set) ，通常儲存在一塊連續的記憶體上

public class Array
{
   public static void main(String[] args)
   {
       int a [] = {1, 5, 6, 9, 5};

       SequentialSearch(a, 9); //循序搜尋

       SearchMaxMinValue(a); //搜尋極大值、極小值

       Accumulate(a);    //累加陣列所有值

       AccumulateOddEven(a);   //分別累加陣列奇數、偶數

       ArrayCopy(a); //陣列複製

       ReverseSequence(a); //倒序複製
   }
   public static void SequentialSearch(int array[], int key)
   {
       boolean flag = false;
       for(int i = 0; i < array.length; i++)
       {
           if(key == array[i])
           {
               System.out.println("Find the index in the array: " + i);
               flag = true;
               break;
           }
       }
       if(flag == false)
       {
           System.out.println("No Find in the array!");
       }
   }

   public static void SearchMaxMinValue(int array[])
   {
       int max = Integer.MIN_VALUE;
       int min = Integer.MAX_VALUE;

       for(int i = 0; i < array.length; i++)
       {
           if(array[i] > max)
           {
               max = array[i];
           }
           if(array[i] < min)
           {
               min = array[i];
           }

       }
       System.out.println("Max: " + max);
       System.out.println("Min: " + min);
   }

   public static void Accumulate(int array[])
   {
       int sum = 0;
       for(int i = 0; i < array.length; i++)
       {
           sum = sum + array[i];
       }
       System.out.println("sum: " + sum);
   }

   public static void AccumulateOddEven(int array[])
   {
       int sum_Odd = 0;
       int sum_Even = 0;
       for(int i = 0; i < array.length; i++)
       {
           if(array[i] % 2 == 1)
           {
               sum_Odd += array[i];
           }
           else
           {
               sum_Even = sum_Even + array[i];
           }
       }
       System.out.println("sum_Odd: " + sum_Odd);
       System.out.println("sum_Even: " + sum_Even);
   }

   public static void ArrayCopy(int array[])
   {
       int copy_array[] = new int[array.length];

       for(int i = 0; i < array.length; i++)
       {
           copy_array[i] = array[i];
       }

       System.out.print("copy_array: ");

       for(int i = 0; i < copy_array.length; i++)
       {
           System.out.print(copy_array[i] + " ");
       }
       System.out.println();

   }
   public static void ReverseSequence(int array[])
   {
       int reverse_array[] = new int[array.length];

       for(int i = 0; i < array.length; i++)
       {
           reverse_array[i] = array[array.length - 1 - i];
       }

       System.out.print("reverse_array: ");

       for(int i = 0; i < reverse_array.length; i++)
       {
           System.out.print(reverse_array[i] + " ");
       }
       System.out.println();
   }
}