insert in sorted list: improved

Author: Ram swaroop

src/me/ramswaroop/linkedlists/InsertionInSortedList.java renamed to src/me/ramswaroop/linkedlists/InsertInSortedList.java

@@ -10,32 +10,38 @@
  * @date: 6/21/15
  * @time: 10:20 PM
  */
-public class InsertionInSortedList<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class InsertInSortedList<E extends Comparable<E>> extends SingleLinkedList<E> {
 
     /**
      * Insert an element in the sorted linked list.
      *
      * @param item
      */
     public void insert(E item) {
-        int index = 0;
         SingleLinkedNode<E> node = head;
+
         while (node != null) {
-            if (item.compareTo(node.item) < 0) break;
-            index++;
+            if (node.item.compareTo(item) > 0) { // new node is to be inserted before head
+                head = new SingleLinkedNode<>(item, node);
+                return;
+            } else if (node.next == null || node.next.item.compareTo(item) > 0) { // new node to be inserted anywhere else
+                node.next = new SingleLinkedNode<>(item, node.next);
+                return;
+            }
             node = node.next;
         }
-        add(index, item);
     }
 
     public static void main(String a[]) {
-        InsertionInSortedList<Integer> linkedList = new InsertionInSortedList<>();
+        InsertInSortedList<Integer> linkedList = new InsertInSortedList<>();
         linkedList.add(00);
         linkedList.add(11);
         linkedList.add(22);
         linkedList.add(33);
         linkedList.printList();
-        linkedList.insert(13);
+        linkedList.insert(-2);
+        linkedList.insert(9);
+        linkedList.insert(44);
         linkedList.printList();
     }
 }