Need Help'bout Sort with Comparator!!

Question

First of all, the object that Im using is named as "Node". This object has String name, int Value and some kinda things.
In the code below, I made one demantion object array ( Node[]) and filled it with unordered objects. And now I want to sort it by "int Value". There is a function "getVal()" which returns int Value.
Node[] arrlist = new Node[size];
Collect(current, arrlist); <-- this one collects unordered objects
java.util.Collections.sort(arrlist, new Comp());
and the class Comp is below
import java.util.*;
class Comp implements Comparator {
     public int compare(Object o, Object p){
          int answer = 0;
          if (o == p) {
               return 0;
          int node1 = ((Node)o).getVal();
          int node2 = ((Node)p).getVal();
          return node1 - node2;
I dont know much about the comparator. I dont even know what to return in thecomparator class. please help me guys!

Answer 1

You are on the right track. In the compartor, you have to return a negative value, 0 or a possitive value depending on the two values you compare..
some thing like this
public int compare(Object o, Object p){
//.... your codes here
int node1 = ((Node)o).getVal();
int node2 = ((Node)p).getVal();
if( node1 < node2 )
return -1
else
if( node1 > node2 )
  return 1;
else
return 0;
[url http://www.feedfeeds.com/feedtv]FeedTV