利用冒泡法实现一个随机数组中的元素排序

package sort;

import java.util.Arrays;

public class SortDemo01
{
public static void main(String[] args)
{
SortDemo01 num = new SortDemo01();
int []s = num.random();
System.out.println(Arrays.toString(s));
for(int i=1;i<s.length;i++)
{
for(int j=0;j<i;j++)
{
if(s[j]>s[i])
{
int t;
t=s[j];
s[j]=s[i];
s[i]=t;
}
}
}
System.out.println(Arrays.toString(s));

}
public int[] random()
{
int []ary = new int[10];
for(int i=0;i<ary.length;i++)
{
ary[i]=(int)(Math.random()*100+1);
}
return ary;
}
}