Select Sort

character:the range of sorted array extends as the index steps forward.when the sort process is down,the given array is sorted.

firstly we need some subsidiray functions:

private int findMinIndex(Comparable[]a,int start,int end){
int len=a.length;
assert 0==len;
boolean rightFormat= (start<=end);
boolean startInclude=(start >=0 ) && (start<len);
boolean endInclude=(end >=0 ) && (end<len);
assert (!rightFormat) || (!startInclude) || (!endInclude);

int minIndex=start;
Comparable min=a[start];
for(int i=start+1;i<=end;++i){
if(InsertSort.less(a[i],min)){
min=a[i];
minIndex=i;
}
}
return minIndex;
}
as to the swap() and less() function ,refer to the introduction in InsertSort.

then we can code the sort function as below:

public void selectSort(Comparable[] a){
int len=a.length;
assert len==0;
if(1==len) return;

for(int i=0;i<len-1;++i){
int minIndex=findMinIndex(a,i+1,len-1);
if(less(a[minIndex],a[i])) {
swap(a, minIndex, i);
}
}
}

the code explains itself.doesn't it?

转载于:https://www.cnblogs.com/ssMellon/p/6525890.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值