Linked List lerde Sort(recursive)

[Wallace740]

Odev verdi hoca ama isin icinden cikamadim.
Normal link listi yazdim;Node ekleme,cikarma falan(double linked list ile daha mi kolay olur bilmiyorum) fakat sort yapamiyorum,yardimci olacak arkadas var mi?

3 dosya halinde
==================
public class Node {

public int item;
public Node next;

public Node()
{
//item = NULL;

}

public Node(int it)
{
item = it;
}

public void displayNode()
{
System.out.println(" " + this.item);
}

}
=========================
public class LinkedList {

public Node head;

public boolean isEmpty()
{
return (head == null);
}

public void insertFirst(int it)
{
Node newNode = new Node(it);
newNode.next = head;
head = newNode;
}

public Node deleteFirst()
{
Node temp = head;
head = head.next;
return temp; //return deleted link
}

public void displayList()
{
Node current = head;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println("End of list");

}
================Demo programi
import java.util.*;

public class LinkedListDemo {

public static void main(String[] args)
{
LinkedList list = new LinkedList();

Scanner key = new Scanner(System.in);
System.out.println("How many elements do you want in the list?");
int enter = key.nextInt();

for(int i=0;i<enter;i++)
{
int num = (int)(Math.random()*10+1);
list.insertFirst(num);
}

System.out.println("Original list");
list.displayList();

System.out.println("\nHow many elements do you want to delete from the list?");
int enter2 = key.nextInt();

for(int i=0;i<enter2;i++)
{
list.deleteFirst();
}


System.out.println("\nList after deleting elements");
list.displayList();

}
}

[Wallace740]

Recursive olmasa da sort method u bulduk

public void sortList()
{

boolean sorted = false;

while(!sorted)
{
sorted = true;

for(Node current = head ;current.next != null ;current = current.next)
{
if(current.item < current.next.item)
{
int temp = current.item;

current.item = current.next.item;
current.next.item = temp;

sorted = false;
}

}

}
}