http://student.zjzk.cn/course_ware/data_structure/web/PAIXU/paixu8.7.1.1.htm
http://www.cppblog.com/shongbee2/archive/2009/04/25/81038.aspx
http://topic.csdn.net/u/20090713/19/C04FAF7A-5800-4403-8115-1A9CE27D07D8.html
冒泡排序
for(j=0;j<9;j++)
{
for(i=0;i<9-j;i++)
{if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}}
}
插入排序
public void Sort(int [] list)
{
for(int i=1;i <list.Length;++i)
{
int t=list[i];
int j=i;
while((j> 0)&&(list[j-1]> t))
{
list[j]=list[j-1];
--j;
}
list[j]=t;
}
}
http://blog.csdn.net/solarsoft
http://topic.csdn.net/u/20100331/13/03AB3849-9D0D-4139-93A6-BD97E0CE2608.html