基础算法（三）---选择排序（Java）

package SortAlgorithm;

/**
* Created by Promacanthus on 2017/6/12.
*/
public class SelectionSort {
private int[] ints;

SelectionSort(int[] ints){
this.ints = ints;
}

public void selectionsort(int[] ints) {
for (int i = 0; i < ints.length; i++) {
for (int j = i + 1; j < ints.length; j++) {
if (ints[i] > ints[j]) {
swap(ints, i, j);
}
}
}
}

private void swap(int[] ints, int i, int j) {
int temp = ints[i];
ints[i] = ints[j];
ints[j] = temp;
}

public static void main(String[] args){
int[] a = {4, 2, 1, 6, 3, 6, 0, -5, 1, 1};
SelectionSort selectionSort = new SelectionSort(a);
selectionSort.selectionsort(a);

for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
}
}

}