Question

I want to sort a list of android.location.Location. The sort should base on the distance of my location to the location from the list. So i think the distance should be calculated during the search process. And so I’ve decided to use insert sort.

Is this the right choice?

Thanks a lot

Answer 1

If it’s a List of locations, I’d go with Collections.sort + a custom Comparator:

final Location myLocation = someLocation;

Collections.sort(locations, new Comparator<Location>() {
    @Override
    public int compare(Location o1, Location o2) {
        Float dist1 = o1.distanceTo(myLocation);
        Float dist2 = o2.distanceTo(myLocation);
        return dist1.compareTo(dist2);
    }
});