Java selection Sorting Algorithm

Java selection Sorting Algorithm
Sort
Preface: the idea of falling in love with Java has never been erased: "sharing my learning achievements, no matter how deep the technology is in the future, it is very important to lay a good foundation."
Disclaimer: all source codes are original to me, And the evangelists are familiar with each other. They are not used for commercial purposes and are only for learning and sharing. If you want to reprint them, indicate the source.

Tool class Swapper. Later algorithms will use this tool class:

/** * One util to swap tow element of Array *  * @author ysjian * @version 1.0 * @email ysjian_pingcx@126.com * @QQ 646633781 * @telephone 18192235667 * @csdnBlog http://blog.csdn.net/ysjian_pingcx * @createTime 2013-12-20 * @copyRight Merit */public class Swapper {private Swapper() {}/** * Swap tow elements of the array *  * @param oneIndex *            one index * @param anotherIndex *            another index * @param array *            the array to be swapped * @exception NullPointerException *                if the array is null */public static 
 
  > void swap(int oneIndex,int anotherIndex, T[] array) {if (array == null) {throw new NullPointerException("null value input");}checkIndexs(oneIndex, anotherIndex, array.length);T temp = array[oneIndex];array[oneIndex] = array[anotherIndex];array[anotherIndex] = temp;}/** * Swap tow elements of the array *  * @param oneIndex *            one index * @param anotherIndex *            another index * @param array *            the array to be swapped * @exception NullPointerException *                if the array is null */public static void swap(int oneIndex, int anotherIndex, int[] array) {if (array == null) {throw new NullPointerException("null value input");}checkIndexs(oneIndex, anotherIndex, array.length);int temp = array[oneIndex];array[oneIndex] = array[anotherIndex];array[anotherIndex] = temp;}/** * Check the index whether it is in the arrange *  * @param oneIndex *            one index * @param anotherIndex *            another index * @param arrayLength *            the length of the Array * @exception IllegalArgumentException *                if the index is out of the range */private static void checkIndexs(int oneIndex, int anotherIndex,int arrayLength) {if (oneIndex < 0 || anotherIndex < 0 || oneIndex >= arrayLength|| anotherIndex >= arrayLength) {throw new IllegalArgumentException("illegalArguments for tow indexs [" + oneIndex + ","+ oneIndex + "]");}}}
 

Select the Sorting Algorithm SelectionSortord:

/** * Selection sort order, time complexity is O(n2) *  * @author ysjian * @version 1.0 * @email ysjian_pingcx@126.com * @QQ 646633781 * @telephone 18192235667 * @csdnBlog http://blog.csdn.net/ysjian_pingcx * @createTime 2013-12-31 * @copyRight Merit * @since 1.5 */public class SelectionSortord {private static final SelectionSortord INSTANCE = new SelectionSortord();private SelectionSortord() {}/** * Get the instance of SelectionSortord, only just one instance *  * @return the only instance */public static SelectionSortord getInstance() {return INSTANCE;}/** * Sort the array of int with selection sort order *  * @param array *            the array of int */public void doSort(int... array) {if (array != null && array.length > 0) {int length = array.length;// a flag judge whether the array is in orderboolean flag = true;for (int i = 0; i < length - 1 && flag; i++) {flag = false; // set the flag false// set the current index value as minimum in every circulationint min = i;for (int j = i + 1; j < length; j++) {// compare with the value after index iif (array[min] > array[j]) {flag = true; // if not in order,set flag true/* * if the value of index j is lower then exchange the * minimum value index */min = j;}}if (flag) {// if has exchange then swap the two elementsSwapper.swap(i, min, array);}}}}/** * Sort the array of generic T with selection sort order *  * @param array *            the array of generic */public 
 
  > void doSortT(T[] array) {if (array != null && array.length > 0) {int length = array.length;boolean flag = true;for (int i = 0; i < length - 1 && flag; i++) {flag = false;int min = i;for (int j = i + 1; j < length; j++) {if (array[min].compareTo(array[j]) > 0) {flag = true;min = j;}}if (flag) {Swapper.swap(i, min, array);}}}}}
 

Test TestSelectionSortord:

/** * Test the selection sort order *  * @author ysjian * @version 1.0 * @email ysjian_pingcx@126.com * @QQ 646633781 * @telephone 18192235667 * @csdnBlog http://blog.csdn.net/ysjian_pingcx * @createTime 2013-12-31 * @copyRight Merit */public class TestSelectionSortord {/** * Test *  * @param args */public static void main(String[] args) {SelectionSortord selectSort = SelectionSortord.getInstance();int[] array = { 25, 36, 21, 45, 98, 13 };System.out.println(Arrays.toString(array));selectSort.doSort(array);System.out.println(Arrays.toString(array));System.out.println("------------------------");Integer[] arrayT = { 25, 36, 21, 45, 98, 13 };System.out.println(Arrays.toString(arrayT));selectSort.doSortT(arrayT);System.out.println(Arrays.toString(arrayT));}}

Sort