冒泡排序 java

import java.util.*;
 
public class maino {

        public static void main(String[] args) {
                Scanner cin = new Scanner(System.in);
                String num;
                int temp;
                while(cin.hasNext())
                {
                	num= cin.next();
                	
                	
                	String no[] = num.split(",");
                	int[] zsd =new int[no.length];
                	
                    if(num.equals("0"))
                    	break;
                    
                    for(int i =0;i<no.length;i++)
                    	zsd[i] = Integer.parseInt(no[i]);
                    
                    for(int i =0;i<no.length-1;i++)
                    {
                    	
                    for(int j=no.length-1;j>i;j--)
                    {                     
                    

 
                    if(zsd[j]>zsd[i])
                    {
                    	zsd[j]=zsd[j]+zsd[i];
                    	zsd[i]=zsd[j]-zsd[i];
                    	zsd[j]=zsd[j]-zsd[i];
                    	
                    }
                    }
                    }
                    for(int t=0; t<zsd.length;t++){
                    	if(t == zsd.length-1)
                    System.out.print(zsd[t]);
                    	else
                    		System.out.print(zsd[t]+",");	}
                }
                    

                
        }
}