Algorithm (JAVA) ---- two small after-school questions

    Random RANDOM =  Random(47       ( i = 0; i < 10; i++100000       sort( ( i = 1; i < values.length; i++ ( j = 0; j < values.length - i; j++ (values[j] > values[j + 1 temp == values[j + 1+ 1] =       select( (values ==  || values.length == 0  NullPointerException("values can't be null." k = values.length / 2[] temp = ( i = k ; i < values.length; i++ (values[i] < temp[k - 1- 1] = temp[k - 2 ( j = k - 2; j >0; j-- (values[i] >+ 1] == temp[j - 1 temp[k - 1      [] createArray([] values =   ( i = 0; i < length; i++= RANDOM.nextInt(length * 2       printResult("length:" + start ="result:" +"cost:" + (System.currentTimeMillis() - start) + "ms""--------------------------------"

    Random RANDOM =  Random(47   String[] WORDS =  String[]{"ynz","yzgm","oqz","owznt","z"  [][] chars = createTable(5       findWord( start = ( i = 0; i < chars.length; i++ ( j = 0; j < chars.length; j++ ( k = 0; k < chars.length; k++ ( l = 0; l < chars.length; l++ (i == k && j == (k != i && j != l && (k - i) != (j - l) && (k - i) != (l -=  (i == (j > ( m = j; m >= l; m-- ( m = j; m <= l; m++ (j == (i > ( m = i; m >= k; m-- ( m = i; m <= k; m++ ((k - i) == (j - (i > ( m = i,n = j; m >= k && n <= l; m--,n++ ( m = i,n = j; m <= k && n >= l; m++,n-- ((k - i) == (l - (i > ( m = i,n = j; m >= k && n >= l; m--,n-- ( m = i,n = j; m <= k && n <= l; m++,n++"-------------------------------------------------""cost time:" + (System.currentTimeMillis() - start) + "ms"       printWord(String word, i , j, k, ( m = 0; m < WORDS.length; m++"find word:" +"scalar:" + "[" + (i+1) + "," + (j+1) + "]->[" + (k+1) + "," + (l+1) + "]"      [][] createTable([][] chars =   ( i = 0; i < chars.length; i++ ( j = 0; j < chars[i].length; j++= ()(97 + RANDOM.nextInt(26       printTable("---------------------------------------------" ( i = 0; i < chars.length; i++"\t" + (i+1 ( i = 0; i < chars.length; i+++1 ( j = 0; j < chars.length; j++"\t" +"---------------------------------------------"