oNe8

Ok this one has me pretty stumped for something that should seem very simple.

SO i have an object[] that i need to sort by in alabetical order by the String returned by object.getName(). I suspose this can be done some how by using Arrays.sort(object[], Comparator c) but i have no idea how i would go about that.

I the only reason i really want the array sorted it just so i can save processing power by using a binary search later on rather then brute forcing the hell out of the array.

__________________
http://img523.imageshack.us/img523/8436/user9kz.jpg

jaeusm

You could just implement one of the more efficient sort algorithms, like merge sort or quicksort. It doesn't require much effort.

titaniumdecoy

Create a class, say ObjectNameComparator, that extends Comparator and implements public int compare(Object obj1, Object obj2) and returns -1 if obj1 is larger than obj2, 0 if they are the same, and 1 if obj1 is smaller.

In your main method, import java.util.Arrays. Create a new instance of ObjectNameComparator. Sort the array object[] using Arrays.sort(object, new ObjectNameComparator()).