آموزش جاوا - قسمت ششم

 final int[] array = new int[5];
array[0] = 2;
final Student[] students = new Student[5];
students[0] = new Student();

 public int[] incValue(int[] array){
 for(int i = 0; i < array.length; i++){
 array[i] = array[i] + 1;
 }
 return array;
}

 final int[] array1 = {1, 3, 2, 5, 8};
final int[] array2 = incValue(array1);

 System.out.println(Arrays.toString(array1));
System.out.println(Arrays.toString(array2));

public class Arrays {
    /**
     * The minimum array length below which a parallel sorting
     * algorithm will not further partition the sorting
     * smaller sizes typically results in memory contention across
     * tasks that makes parallel speedups unlikely.
     */
    private static final int MIN_ARRAY_SORT_GRAN = 1<< 13;
    
    // Supresser default constructor, ensuring non-instantiability.
    private Arrays() {}
}

 int[][] array = new int[2][3];
array[0][0] = 6;

 int[][] array = {{1, 2, 3}, {3, 4, 5}};

 int[][] array = new int[3][];
array[0] = new int[2];
array[1] = new int[5];
array[2] = new int[1];

 int[][] array = {{1,2}, {1,2,3,4,5}, {1}};

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

 [2, 4, 3, 6, 9]
[2, 4, 3, 6, 9]