Thread: Make code more compact

Hi guys,

The code below works. The code does what it should do. But is there a way to make the code more compact. Writing "beautifull code". Someone got some suggestions?

  public void bubbleSort(){
        int outer, inner;
        NAW temp;
 
        for(outer = nElems-1; outer > 0; outer--){
            for(inner=0; inner < nElems-1; inner++){
                int compareName = nawdata[inner].getName().compareTo(nawdata[inner+1].getName());
                if (compareName >= 0){
                    temp = nawdata[inner]; 
                    nawdata[inner] = nawdata[inner+1]; 
                    nawdata[inner+1] = temp; 
                }  
                }
        }
        for(outer = nElems-1; outer > 0; outer--){
            for(inner=0; inner < nElems-1; inner++){
                int compareName = nawdata[inner].getName().compareTo(nawdata[inner+1].getName());
                if (compareName == 0){
                   int compareResidence = nawdata[inner].getResidence().compareTo(nawdata[inner+1].getResidence());
                   if (compareResidence >= 0){
                   temp = nawdata[inner]; 
                   nawdata[inner] = nawdata[inner+1]; 
                   nawdata[inner+1] = temp; 
                   }  
                }  
            }
        }
    }

--- Update ---

note:

the code sorts an array with strings name, address, residence alphabetical.
first it sorts the name, when the name is the same it sorts the residence alphabetical.