冒泡排序算法

public class name { public static void main(String[] args){ int d; int[] a = new int[]{1,8,7,9,10}; for(int c = 0;c<a.length -1;c++){ for(int v=0;v<a.length-1-c;v++){ if(a[v]>a[v+1]){ d= a[v]; a[v]=a[v+1]; a[v+1]=d; } } } for(int i=0;i<=4;i++){ System.out.println(a[i]); } } }