Granny's Programming Pearls
"inside of every large program is a small program struggling to get out"
The moose likes Java in General and the fly likes Sorting Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login

Win a copy of Android Security Essentials Live Lessons this week in the Android forum!
JavaRanch » Java Forums » Java » Java in General
Bookmark "Sorting " Watch "Sorting " New topic


divya kundapur
Ranch Hand

Joined: Aug 21, 2007
Posts: 110
I have an array 'items' which have objects that need to be compared and sorted, but the array will have objects that are not mutually comparable, how can i make sure the objects which are not mutually comparable be at the end ?

I know the below one does have work when objects are not mutually comparable , should i implement sorting in this case.

Arrays.sort(items, new ItemNameComparator());

SCJP - 5.0
Vinoth Kumar Kannan
Ranch Hand

Joined: Aug 19, 2009
Posts: 276

You will have to write a class that implements the Comparator interface and pass that object to Arrays.sort(). So, you must override compare() and equals() methods of Comparator.

Rob Spoor

Joined: Oct 27, 2005
Posts: 19656

Only compare(). The equals method is used to check if another object is equal to the Comparator itself, and is hardly ever needed for Comparator implementations.

How To Ask Questions How To Answer Questions
I agree. Here's the link:
subject: Sorting
Similar Threads
What it means
Sorting descendingly, but im after ascendingly
K&B book (mutually comparable)
Output for Arrays.binarySearch()
TreeSet Question