数组的迭代选择排序算法(Java)2007-04-1315:53/
Filsename:SortArray.java
Task:数组的迭代选择排序算法
/
publicclassSortArray{
publicstaticvoidmain(String[]args)
{
intarray[]={8,9,1,4,2,3,0,6,5,7};
display(array);
selectionSort(array,array.length);
display(array);
}
publicstaticvoidselectionSort(int[]a,intn)
{
for(intindex=0;index
{
intindexOfNextSomallest=indexOfSmallest(a,index,n-1);
swap(a,index,indexOfNextSomallest);
}
}
privatestaticintindexOfSmallest(int[]a,intfirst,intlast)
{
intmin=a[first];
intindexOfNextSmallest=first;
for(intindex=first+1;index<=last;index++)
{
if(a[index]
{
indexOfNextSmallest=index;
min=a[index];
}
}
returnindexOfNextSmallest;
}
privatestaticvoidswap(int[]a,inti,intj)
{
inttemp=a[i];
a[i]=a[j];
a[j]=temp;
}
publicstaticvoiddisplay(int[]a)
{
for(inti=0;i
System.out.print(a[i]+"");
System.out.println();
}
}
|
|
