Simple array: int [] a = new int [10] or int [] A = {1, 2, 3} Object array: Integer [] a = new integer [10]; integer [] a = {new integer (1 ), new integer (3),}; integer [] a = new integer [] {new integer (1), new integer (3),} multi-digit array definition: int A [2] [2] = {{{ 1, 2, 3}, {4, 5, 6}}
Arrays: For an array of operations BinarySearch (int [] a, int key, comparator c): Find elements in arrandons sorted according to C, if c is NULL to indicate natural sorting Equals (A1 [], A2 []) : Judging whether the 2 array is element and element of the number of elements (short [] a, int.comindex, int toindex, short val): Fill in the arominDex to ToIndex with VAL. If int.comindex, int toindex is filled The entire array sort (T [] A, INT fromNDEX, INT TOINDEX, COMPARATOR c) Sort the From Ondex to TOINDEX in the C rulence method. If sort (a []) is sorted by nature: transforms the array to the formula Hascode: (to be continued, not understood) to be continued. . .
