java排序汇总68517(国外英语资料).docVIP

java排序汇总68517(国外英语资料) / * * * sort the test class * * sorting algorithms are classified as follows: * 1. (direct insertion sort, insertion sort, binary insertion sort, Hill sort); * 2. exchange sorting (bubble sort, quick sort); * 3. select sort (direct selection, sort, heap sort); * 4. merge sort; * 5. Radix sort. * * selection of sorting methods: * (1) if n is small (n 50), can be used to directly insert or direct selection sort. * when the record is small, direct insertion sort is better; otherwise because the record number is less than the direct selection of mobile directly plugged in, choose the direct selection sorting is appropriate. * (2) if the initial state of the file is basically ordered (or ordered), the direct insertion, bubbling, or random quick sorting should be used; * (3) if the n is large, the method of sorting O (nlgn) with time complexity should be adopted: quick sort, heap sort or merge sort. * * / Public, class, SortTest { / * * * method of initializing test array * @return a good array of initialization * / Public, int[], createArray () { Random random = new, Random (); Int[] array = new int[10]; For (int, I = 0, I, 10, i++) { Array[i] = random.nextInt (100) - random.nextInt (100); / / generate two random numbers subtraction, guarantee that the generated number is negative } System.out.println (========== original sequence ==========); PrintArray (array); Return array; } / * * * print elements from the array to the console * @param source * / Public, void, printArray (int[], data) { For (int i: data) { System.out.print (I +); } System.out.println (); } / * * * swap the location of the two element specified in the array * @param data * @param x * @param y * / Private, void, swap (int[], data, int, x, int, y) { Int temp = data[x]; Data[x] = data[y]; Data[y] = temp; } / * * * bubble sort -- a sort of interchange sort * methods to compare two adjacent elements, such as the need for exchange, every cycle will be the largest element in the last