JAVA冒泡排序
public class MaoPao
{
public static void main(String []args)
{
int arr[]={14,52,16,37,8};
boolean flag=false;
for (int i=0;i<arr.length-1;i++)
{
for (int j=0;j<arr.length-i-1;j++)
{
if (arr[j]<arr[j+1])
{
int temp;
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
flag=true;
}
}
if (flag)
{
flag=false;
}else
{
break;
}
}
for (int i=0;i<arr.length;i++)
{
System.out.println(arr[i]);
}
}
}