标签：blog java strong for ar div log line
数组的四种排序
1.快速排序法Arrays.sort();
用法1.sort(byte[] a)
2.冒泡排序法
int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,18,23,34,15,35,25,53,51};
int temp=0;
for (int i = 0; i < a.length - 1; i++)
{
for (int j = 0; j < a.length - 1 - i; j++)
{
if (a[j] > a[j + 1])
{
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
3.选择排序
int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,18,23,34,15,35,25,53,51};
for(int i=0;i<a.length;i++){
for(int j=i+1;j<a.length;j++){
if(a[i]>a[j]){
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
4.插入排序
int a[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,18,23,34,15,35,25,53,51};
for (int i = 1; i < a.length; i++)
{
for (int j = i; j > 0; j--)
{
if (a[j] < a[j - 1])
{
int temp = a[j - 1];
a[j - 1] = a[j];
a[j] = temp;
}
else
break;
}
}
标签：blog java strong for ar div log line
原文地址：http://www.cnblogs.com/wcyBlog/p/3926497.html
