冒泡排序

package com.qf.homework;

public class maopao { public static void main(String[] args) { int ar[]= {1,8,2,9,4}; int vvc[]= {}; vvc= sort1(ar);//vvc代表整个数组名 for (int i = 0; i < vvc.length; i++) { System.out.println(vvc[i]); } } public static int [] sort1(int arr[]) { for (int i = 0; i < arr.length-1; i++) { for (int j = 0; j < arr.length-1-i; j++) { if(arr[j]>arr[j+1]) { int temp =arr[j]; arr[j]=arr[j+1]; arr[j+1]=temp;

			}
		}
	}
	return  arr;
	
	
}

}