c# 排序 算法 函数 冒泡 选择 插入 希尔

一、冒泡排序(bubble)

usingsystem;

namespacebubblesorter
{
publicclassbubblesorter
{
publicvoidsort(int[]list)
{
inti,j,temp;
booldone=false;
j=1;
while((j<list.length)&&(!done))
{
done=true;
for(i=0;i<list.length-j;i++)
{
if(list[i]>list[i+1])
{
done=false;
temp=list[i];
list[i]=list[i+1];
list[i+1]=temp;
}
}
j++;
}
}
}

publicclassmainclass
{
publicstaticvoidmain()
{
int[]iarrary=newint[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
bubblesortersh=newbubblesorter();
sh.sort(iarrary);
for(intm=0;m<iarrary.length;m++)
console.write("{0}",iarrary[m]);
console.writeline();
}
}
}

二、选择排序(selection)

usingsystem;

namespaceselectionsorter
{
publicclassselectionsorter
{
privateintmin;
publicvoidsort(int[]list)
{
for(inti=0;i<list.length-1;i++)
{
min=i;
for(intj=i+1;j<list.length;j++)
{
if(list[j]<list[min])
min=j;
}
intt=list[min];
list[min]=list[i];
list[i]=t;
}
}
}

publicclassmainclass
{
publicstaticvoidmain()
{
int[]iarrary=newint[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};
selectionsorterss=newselectionsorter();
ss.sort(iarrary);
for(intm=0;m<iarrary.length;m++)
console.write("{0}",iarrary[m]);
console.writeline();
}
}
}

三、插入排序(insertionsorter)

usingsystem;

namespaceinsertionsorter
{
publicclassinsertionsorter
{
publicvoidsort(int[]list)
{
for(inti=1;i<list.length;i++)
{
intt=list[i];
intj=i;
while((j>0)&&(list[j-1]>t))
{
list[j]=list[j-1];
--j;
}
list[j]=t;
}
}
}

publicclassmainclass
{
publicstaticvoidmain()
{
int[]iarrary=newint[]{1,13,3,6,10,55,98,2,87,12,34,75,33,47};
insertionsorterii=newinsertionsorter();
ii.sort(iarrary);
for(intm=0;m<iarrary.length;m++)
console.write("{0}",iarrary[m]);
console.writeline();
}
}
}

四、希尔排序(shellsorter)

usingsystem;

namespaceshellsorter
{
publicclassshellsorter
{
publicvoidsort(int[]list)
{
intinc;
for(inc=1;inc<=list.length/9;inc=3*inc+1);
for(;inc>0;inc/=3)
{
for(inti=inc+1;i<=list.length;i+=inc)
{
intt=list[i-1];
intj=i;
while((j>inc)&&(list[j-inc-1]>t))
{
list[j-1]=list[j-inc-1];
j-=inc;
}
list[j-1]=t;
}
}
}
}

publicclassmainclass
{
publicstaticvoidmain()
{
int[]iarrary=newint[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
shellsortersh=newshellsorter();
sh.sort(iarrary);
for(intm=0;m<iarrary.length;m++)
console.write("{0}",iarrary[m]);
console.writeline();
}
}
}