selectionsort.java~1~

来自「数据结构综合实验,有各种排序算法和计算排序时间,最短路径算法,huffman编码」· JAVA~1~ 代码 · 共 34 行

package datas2;

public class Selectionsort {
    private int[] array;
    public  Selectionsort(int max)
    {
        array = new int[max];
        for (int i = 0; i < array.length; i++)
        {
            array[i] = (int)(java.lang.Math.random()*max);
        }
    }
    public int[] selectionsort()
    {
            int i,j;
            int l = 0;
            for(i = 0; i < array.length; i++)
            {
                    for(j = i + 1; j < array.length; j++)
                            if(array[j] < array[l])
                                    l = j;
                    swap(array,l,i);
            }
            return array;
    }
    //交换e1,e2
    public  void swap(int[] a, int e1, int e2)
    {
            int temp = a[e1];
            a[e1] = a[e2];
            a[e2] = temp;
	}
}