Create a list / arraylist of objects and sort the list (Java) [duplicate]

Question

Possible Duplicate:
Sorting an ArrayList of Contacts based on name?

I have a student object and then I create ArrayList and add student to the list.

ArrayList<Student_Object> studentsList = new ArrayList<>();

Now, I want to sort the list by studentId fleid. How can I do it?

Is there a better solution? Thanks

So I have this method in the Student _Object class

Class is:

class Student_Object implements Comparator<Student_Object>

The method is:

public int compare(Student_Object student1, Student_Object student2){
    String student1TUID = student1.getTUID();        
    String student2TUID = student2.getTUID();

return student1TUID.compareTo(student2TUID);   


}

From where do I run the statment?

Collections.sort(studentsList);

If I run it from my main class I get error in netbeans:

no suitable method found for sort(ArrayList<Student_Object>)
    method Collections.<T#1>sort(List<T#1>,Comparator<? super T#1>) is not applicable
      (cannot instantiate from arguments because actual and formal argument lists differ in length)
    method Collections.<T#2>sort(List<T#2>) is not applicable
      (inferred type does not conform to declared bound(s)
        inferred: Student_Object
        bound(s): Comparable<? super Student_Object>)
  where T#1,T#2 are type-variables:
    T#1 extends Object declared in method <T#1>sort(List<T#1>,Comparator<? super T#1>)
    T#2 extends Comparable<? super T#2> declared in method <T#2>sort(List<T#2>)
----
(Alt-Enter shows hints)

Got it to work. I used Collections.sort(studentsList, new Student_Object());

Thanks everyone

@RohitJain in reality it should be combined and a new question of the form "Sort list based on arbitrary field", however those combinations seem to get knocked down. — Woot4Moo
– Woot4Moo, Commented Oct 24, 2012 at 19:47

kosa · Accepted Answer · 2012-10-24 20:04:56Z

8

One way would be:

Write a comparator and override compare method. Then use Collections.sort() by passing comparator.

Example:

class StudentComparator implements Comparator<Student> {

    public int compare(Student stud1, Student stud2){

        int stu1ID = stud1.getId();       
        int stu2ID = stud2.getId();

        if(stu1ID > stu2ID)
            return 1;
        else if(stu1ID < st21ID )
            return -1;
        else
            return 0;    
    }

}

Another flavor may be:

 class StudentComparator implements Comparator<Student> {

        public int compare(Student stud1, Student stud2){

            int stu1ID = stud1.getId();       
            int stu2ID = stud2.getId();

           return stud1ID-stu2ID;
        }

    }

This tutorial may help you.

edited Oct 24, 2012 at 20:04

answered Oct 24, 2012 at 19:43

kosa

66.7k15 gold badges134 silver badges170 bronze badges

Sign up to request clarification or add additional context in comments.

14 Comments

Rohit Jain Over a year ago

Better implement a generic Comparator. No typecast needed. And why not just do: - return stuID1 - stud2ID;??

kosa Over a year ago

@RohitJain: The tutorial I have added as reference not using generics, I thought that may confuse OP. Thanks for edit.

kosa Over a year ago

@RohitJain: I guess stud1-stud2 is not guaranteed to return either 1, -1, 0. Sometimes it could be higher vlaue, isn't it?

Rohit Jain Over a year ago

You're welcome. You can also consider returning simply the difference, rather than that if-else block. that will do the job. :)

Rohit Jain Over a year ago

Yeah but does it matter? sort method just care about, positive or negative value, or 0 for equal.

|

Woot4Moo · Accepted Answer · 2012-10-24 19:51:48Z

4

To do sorting you need to implement the Comparable interface. I would also highly recommend implementing equals and hashCode while you are in there. Example:

public class Student implements Comparable  
{  
    private String name;  
    private int id;  
    ...

    public int compareTo(Student otherStudent)  
    {  
       if(this.id < otherStudent.id)  
       {  
          return -1;
       }  
       else if(this.id > otherStudent.id)  
       {  
           return 1;
       }  
        else{
           return 0;  
        }  

    }  
}

edited Oct 24, 2012 at 19:51

answered Oct 24, 2012 at 19:46

Woot4Moo

24.4k19 gold badges103 silver badges156 bronze badges

5 Comments

jlordo Over a year ago

public int compareTo(Student otherStudent) { return this.id - otherStudent.id; } will do the job, too ;)

Woot4Moo Over a year ago

@jlordo indeed it will,not sure which is faster though, doing a calculation or doing a logical compare.

jlordo Over a year ago

please change your return type to int

Woot4Moo Over a year ago

@jlordo to quick on the typing =p

jlordo Over a year ago

Performance is an interesting point, does anyone know how the resulting bytecode looks?

Collectives™ on Stack Overflow

Create a list / arraylist of objects and sort the list (Java) [duplicate]

2 Answers 2

14 Comments

5 Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

14 Comments

5 Comments

Linked

Related