input: int[] a
/*选择排序法*/
if(a==null || a.length() < 2)
{return;}
int len = a.length();
int j = 0;
for(int i = 1; i < len; i++)
{
int tmp = a[i];
j = i-1;
while(j>=0 && tmp<a[j])
{
a[j+1] = a[j];
j--;
}
a[j+1] = tmp;
}
input: int[] a
/*选择排序法*/
if(a==null || a.length() < 2)
{return;}
int len = a.length();
int j = 0;
for(int i = 1; i < len; i++)
{
int tmp = a[i];
j = i-1;
while(j>=0 && tmp<a[j])
{
a[j+1] = a[j];
j--;
}
a[j+1] = tmp;
}