[数据结构][Sort]Select Sort

public class Solution
{
    public void selectSort(int[] data)
    {    
        for(int i = 0; i < data.length - 1; i ++)
        {
            int minPosition = i;
            
            for(int j = i; j < data.length; j ++)
            {
                if(data[j] < data[minPosition])
                {
                    minPosition = j;
                }
            }
            
            exchange(data, i, minPosition);
        }
    }
    
    public void exchange(int[] data, int m, int n)
    {
        int memory = data[m];
        
        data[m] = data[n];
        
        data[n] = memory;
    }
    
}