Rgds : Sort by compareTo interface Comparable.

Question

Hi , i got a txt file call Summary.txt
which record the following
[playerName,NumberOfAttempts]
eg:
jack,2
peter,1
albert,6
jammy,5
jean,2
tester1,9
lordz,7
My question is " How Do I Sort by Implements Comparator interface " ,
I DO search the forum on information but most of the thread is about Obj in form of Integer , mine records is record in this way
[font color=red]
Then they only compare Object 1 and Object 2 , i want is compare all the numerOfAttempts record in my Summary.txt then arrange in ASCending order.
[font]
playername,numberOfAttempts means i need use StringTokenizer to break the string into 2 tokens
namely playerName and numberOfAttempts .
Firstly , how do i set playerName & numberOfAttempts together but sort only by numberOfAttempts . After sort , i can display out the playerName.
I was advised to create 2 Objects Array but got people reply that it is dumb to do so , then i search on the advised Comparable but i never see a string example.
anyone can help me?
To be specific what i want is :
Firstly => Obtain the String in form of
First Token = PlayerName
Second Token = numberOfAttempts
THEN sort by numberOfAttempts.
Lastly => Display Top 10 ranking as in form of
LEAST numberOFAttempts = at the most best rank.
1. playerName - numberOfAttempts
2. playerName - numberOfAttempts
null
Message was edited by:
baoky

Answer 1

I seen the code and this code is working fine. but theres 1 thing problem .
Firstly => The System.out.println print a whole straight line of values which is sorted .
But what i want to do is actually
=> jtaLog.append("1. " playerName numberOfGuess);
In the vector form i cant really append in that way.
I learn that Vector got a code method that is
copyInto
public void copyInto(Object[] anArray)
How do i create Object that record from the Vector after sort and append the top 10 list of playerName","noOfGuess to my jtaRanking.
Sorry for the trouble and thanks for the code , I had it read and understand how it works.
import java.io.*;
import java.util.*;
public class sortby {
     public sortby() {
          //super();
          // TODO Auto-generated constructor stub
      * @param args
     public static void main(String[] args) {
          // TODO Auto-generated method stub
          try {
               BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream("summary.txt")));
               String linedata="";
               Vector v=new Vector();
               while((linedata=br.readLine())!=null)
                    StringTokenizer tok=new StringTokenizer(linedata,",");
                    if(tok.countTokens()>=2)
                         String val=tok.nextToken();
                         String num=tok.nextToken();
                         player p=new player();
                         p.setName(val);
                         p.setAttemps(num);
                         v.add(p);
               Collections.sort(v,new mycompare());
               System.out.println(v);
          } catch (FileNotFoundException e) {
               // TODO Auto-generated catch block
               e.printStackTrace();
          } catch (IOException e) {
               // TODO Auto-generated catch block
               e.printStackTrace();
class player
     private String name;
     private String attemps;
     public String getAttemps() {
          return attemps;
     public void setAttemps(String attemps) {
          this.attemps = attemps;
     public String getName() {
          return name;
     public void setName(String name) {
          this.name = name;
     public String toString()
          return this.getAttemps()+","+this.getName();
class mycompare implements Comparator
     public int compare(Object arg0, Object arg1) {
          if(arg0 instanceof player & arg1 instanceof player)
               player p1=(player)arg0;
               player p2=(player)arg1;
               int pi1=Integer.parseInt(p1.getAttemps());
               int pi2=Integer.parseInt(p2.getAttemps());
               if(pi1>pi2)
                    return 1;
               else if(pi1<pi2)
                    return -1;
               else
                    return 0;
          return 0;