经典的JAVA面试题排序(国外英语资料).docVIP

经典的JAVA面试题排序(国外英语资料) The algorithm, a int array, sort out the following requirements. (for example, 10, 0, 9, 1, 8, 2......) , Import java.lang.Math; Import java.util.Random; / * * * sort * * @author javajack * / Public class {OrderTest Public static void main (String args[]) { OrderTest.ExecOrder (2); } / * * * the exchange value, the two value exchange array * @param array * @param I * @param J * / Private static void swap (int[] array, int i, int j) { Int TMP = array[i]; Array[i] = array[j]; Array[j] = tmp; } / * * * * @param method * 1 to 2 for the ascending, descending * / Public static void ExecOrder (int method) { Int[] array = null; Array = initArray (10, 210, 10); //int[] orderarray = bubbleOrder (array, method); Int[] orderarray = doubleBubbleOrder (array, method); //int[] orderarray = insertOrder (array, method); //int [] orderarray = quickOrder (array, method); //int[] orderarray = selectOrder (array, method); For (int i = 0; I orderarray.length; i++) { System.out.println (orderarray[i]); } } / * * * random data, initialize an array * * @param min * the minimum value of the random number * @param Max * the maximum value * @param size * obtain random number * @return * / Public static int[] initArray (int min, int max, int size) { Int[] init = new int[size]; For (int i = 0; I size; i++) { Random RA = new (Random); Init[i] = min + (int) (Math.random (*) (max - min + 1)); System.out.println (I + , + init[i]); } Return init; } / * * * exchange sorting method * principle: in order to exchange value * @param array * @return * / Public static int[] convertOrder (int[] array, int method) { For (int i = 0; I array.length; i++) { For (int j = I + 1; J array.length; j++) { If (method==2) { If (array[i] array[j]) Swap (array, I, J); }else if (method = = 1) { If (array[i] array[j]) Swap (array, I, J); } } } Return array; } / * * bubble sort method * principle: small or large gradually emerge from the beginning of last * @param array * @param method * @return *