Question

Say I have arraylist A and to compare 2 objects of A I do a.getDistanceFromPlayer() < b.getDistanceFromPlayer().

I want to now have list B which will have all of A‘s objects, but sorted where the first object is closest to player, and last object is furthest.

What might be the fastest way to do this?

Thanks

Answer 1

Have A implement Comparable and then define the method compareTo(Object other) like so:

public int compareTo(Object other) {
  if( this.getDistanceFromPlayer() < other.getDistanceFromPlayer() ) {
      return -1;
  } else if( this.getDistanceFromPlayer() > other.getDistanceFromPlayer())  {
      return 1;
  }
  return 0;
}

Now you can call Collections.sort() on your list of objects