Java实现排序算法之选择排序
Java实现排序算法之选择排序
head指针指向每次循环中的第一个位置(去掉最小值之后)
rear指针在每次循环中遍历找最小值,如果有比head位置小的值,就与之交换
import java.util.Arrays;
public class SelectionSort {
public static void sort(int[] data){
int temp;
int head = 0;
int rear = head+1;
while (head<data.length-1){
while(rear<=data.length-1) {
if (data[head]>data[rear]){
temp = data[head];
data[head] = data[rear];
data[rear] = temp;
}
rear++;
}
head++;
rear = head+1;
}
}
public static void main(String[] args) {
int[] test = new int[]{9,836,72,6,5,42467,3,20,1};
sort(test);
System.out.println(Arrays.toString(test));
}
}