bubble sort help.

[evilmonkey]

I am trying to sort an array by name ( that works) but I only need each sorted name to show up once, regardless of how many times it shows up in the sort. Where do I go from here?

public class Report {
    Rental[] rentals = new Rental[20];
    /** Creates a new instance of Report */
    public CustomerReport() {
    }
    public Rental[]sort(Rental[] rentals)
  {
        Rental[] newRentals = new Rental[rentals.length];
        for (int i = 0; i < rentals.length; i++){
                 newRentals[i] = rentals[i];
        }
        int n = rentals.length;
        for (int pass=1; pass < n; pass++){
                 for(int i=0; i< n-pass; i++){
                       int result = newRentals[i].getCustomer().getName().compareTo(newRentals[i+1].getCustomer().getName());
                            if(result > 0)
                                 {
                                   Rental temp = newRentals[i];
                                   newRentals[i] = newRentals[i+1];
                                   newRentals[i + 1] = temp;
                                   }
        } 
     } return newRentals;
   }
public Rental[] getRentals(){
    return rentals;
  }
  }

[JosAH]

Does the sorting method has to be a bubble sort? If not simply add all your
array elements to a SortedSet. It will remove the duplicates for you and sort
all the unique members. All you have to do is make your class implement
the Comparable interface.

kind regards,

Jos

[r035198x]

I am trying to sort an array by name ( that works) but I only need each sorted name to show up once, regardless of how many times it shows up in the sort. Where do I go from here?

public class Report {
Rental[] rentals = new Rental[20];
/** Creates a new instance of Report */
public CustomerReport() {
}
public Rental[]sort(Rental[] rentals)
{
Rental[] newRentals = new Rental[rentals.length];
for (int i = 0; i < rentals.length; i++){
newRentals[i] = rentals[i];
}
int n = rentals.length;
for (int pass=1; pass < n; pass++){
for(int i=0; i< n-pass; i++){
int result = newRentals[i].getCustomer().getName().compareTo(newRentals[i+1].getCustomer().getName());
if(result > 0)
{
Rental temp = newRentals[i];
newRentals[i] = newRentals[i+1];
newRentals[i + 1] = temp;
}
} 
} return newRentals;
}
public Rental[] getRentals(){
return rentals;
}
}

You can also read this tip of the week.