java 冒泡排序方法

/**
 * Created by IntelliJ IDEA.
 * User: new2
 * Date: 2009-8-14
 * Time: 12:03:44
 * To change this template use File | Settings | File Templates.
 */
public class testwyy {

    public static void main(String args[]){

        int  b [] = {1,5,4,8,55,3,43,108} ;
        int  c [] = new int[b.length] ;

        for(int m=0;m<b.length;m++){
            for(int n=0;n<b.length-1;n++){
                if(b[n]>b[n+1]){
                    c[n]=b[n];
                    c[n+1]=b[n+1];
                    b[n]=c[n];
                    b[n+1]=c[n+1];
                }else{
                    c[n]=b[n+1];
                    c[n+1]=b[n];
                    b[n]=c[n];
                    b[n+1]=c[n+1];
                }

            }