public class LinkedList { // reference to the head node. private Node head; private int listCount; // LinkedList constructor public LinkedList() { // this is an empty list, so the reference to the head node // is set to a new node with no data head = new Node(null); listCount = 0; } public void add(Object data) // post: appends the specified element to the end of this list. { Node temp = new Node(data); Node current = head; // starting at the head node, crawl to the end of the list while(current.getNext() != null) { current = current.getNext(); } // the last node's "next" reference set to our new node current.setNext(temp); listCount++;// increment the number of elements variable } public void add(Object data, int index) // post: inserts the specified element at the specified position in this list. { Node temp = new Node(data); Node current = head; // crawl to the requested index or the last element in the list, // whichever comes first for(int i = 1; i < index && current.getNext() != null; i++) { current = current.getNext(); } // set the new node's next-node reference to this node's next-node reference temp.setNext(current.getNext()); // now set this node's next-node reference to the new node current.setNext(temp); listCount++;// increment the number of elements variable } public Object get(int index) // post: returns the element at the specified position in this list. { // index must be 1 or higher if(index <= 0) return null; Node current = head.getNext(); for(int i = 1; i < index; i++) { if(current.getNext() == null) return null; current = current.getNext(); } return current.getData(); } public boolean remove(int index) // post: removes the element at the specified position in this list. { // if the index is out of range, exit if(index < 1 || index > size()) return false; Node current = head; for(int i = 1; i < index; i++) { if(current.getNext() == null) return false; current = current.getNext(); } current.setNext(current.getNext().getNext()); listCount--; // decrement the number of elements variable return true; } public int size() // post: returns the number of elements in this list. { return listCount; } public String toString() { Node current = head.getNext(); String output = ""; while(current != null) { output += "[" + current.getData().toString() + "]"; current = current.getNext(); } return output; } private class Node { // reference to the next node in the chain, // or null if there isn't one. Node next; // data carried by this node. // could be of any type you need. Object data; // Node constructor public Node(Object _data) { next = null; data = _data; } // another Node constructor if we want to // specify the node to point to. public Node(Object _data, Node _next) { next = _next; data = _data; } // these methods should be self-explanatory public Object getData() { return data; } public void setData(Object _data) { data = _data; } public Node getNext() { return next; } public void setNext(Node _next) { next = _next; } } } This is an example how you can sort your LinkedList. I'm using CarNodes and sort it by the year of the car and then write the sorted list to the console The unsorted output will look like VW VR6 170 1997 Volvo 850 170 1992 BMW M3 286 1993 Porsche 911 284 1992 Porsche 911 312 1994 and after calling the sorted method VW VR6 170 1997 Porsche 911 312 1994 BMW M3 286 1993 Volvo 850 170 1992 Porsche 911 284 1992 Any questions can be emailed to fredrick.n@thegate.nu The source code ----------------------------------------------------------- public class Driver { public static void main(String[] arg) { LinkedList list = new LinkedList(); list.addCar("Porsche 911",312,1994); list.addCar("Porsche 911",284,1992); list.addCar("BMW M3 ",286,1993); list.addCar("Volvo 850",170,1992); list.addCar("VW VR6",170,1997); //Method sort the list after year the car was made list.sortList(); //Method to print all objects in List System.out.println(list.viewAll()); } } ----------------------------------------------------------- import java.util.*; public class LinkedList { private CarNode head = null; public void addCar(String name , int hk , int year) { //If head = null then create the first node if(head == null) { head = new CarNode(name,hk,year,null); } else { //If there are more than 1 node head = new CarNode(name,hk,year,head); } } public void sortList() { boolean sorted = false; while(!sorted) { sorted = true; for(CarNode cursor = head ; cursor.getNext() != null ; cursor = cursor.getNext()) { if(cursor.getYear() < cursor.getNext().getYear()) { String n = cursor.getName(); int y = cursor.getYear(); int hk = cursor.getHk(); cursor.setName(cursor.getNext().getName()); cursor.setYear(cursor.getNext().getYear()); cursor.setHk(cursor.getNext().getHk()); cursor.getNext().setName(n); cursor.getNext().setYear(y); cursor.getNext().setHk(hk); sorted = false; } } } } public String viewAll() { StringBuffer str = new StringBuffer(); for(CarNode cursor = head ; cursor != null ; cursor = cursor.getNext()) { //Appending car by car until there are no more cars str.append(cursor+"\n"); } return new String(str); } } ----------------------------------------------------------- public class CarNode { private String name; private int hk; private int year; private CarNode next; public CarNode(String name,int hk,int year,CarNode next) { this.name = name; this.hk = hk; this.year = year; this.next = next; } public CarNode getNext() { return next; } public String getName() { return name; } public int getHk() { return hk; } public int getYear() { return year; } public void setName(String in) { name = in; } public void setHk(int in) { hk = in; } public void setYear(int in) { year = in; } public String toString() { return name + " " + hk + " " + year; } }