insert in sorted circular list: done

Author: Ram swaroop

src/me/ramswaroop/linkedlists/CloneWithRandPointers.java

@@ -11,7 +11,7 @@
  * @time: 1:00 PM
  * @see: http://www.geeksforgeeks.org/a-linked-list-with-next-and-arbit-pointer/
  */
-public class CloneWithRandPointers<E extends Comparable<E>> extends DoubleLinkedList<E> {
+public class CloneWithRandPointers {
 
     /**
      * Clones a linked list with next pointer pointing to the

src/me/ramswaroop/linkedlists/DeleteAlternateNodes.java

@@ -10,7 +10,7 @@
  * @date: 6/27/15
  * @time: 5:27 PM
  */
-public class DeleteAlternateNodes<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class DeleteAlternateNodes {
 
     public static <E extends Comparable<E>> void deleteAlternateNodes(SingleLinkedList<E> list) {
         deleteAlternateNodes(list.head);

src/me/ramswaroop/linkedlists/DeleteNode.java

@@ -10,7 +10,7 @@
  * @date: 6/18/15
  * @time: 2:35 PM
  */
-public class DeleteNode<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class DeleteNode {
 
     /**
      * Given a pointer to a node, delete it.

src/me/ramswaroop/linkedlists/DetectLoop.java

@@ -12,7 +12,7 @@
  * @date: 6/19/15
  * @time: 9:24 AM
  */
-public class DetectLoop<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class DetectLoop {
 
     /**
      * Uses Flyod's Cycle Finding algorithm.

src/me/ramswaroop/linkedlists/InsertInSortedCircularLinkedList.java

@@ -0,0 +1,56 @@
+package me.ramswaroop.linkedlists;
+
+import me.ramswaroop.common.CircularSingleLinkedList;
+import me.ramswaroop.common.SingleLinkedNode;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 6/29/15
+ * @time: 6:16 PM
+ */
+public class InsertInSortedCircularLinkedList<E extends Comparable<E>> extends CircularSingleLinkedList<E> {
+
+    /**
+     * Inserts an element in the sorted circular
+     * linked list maintaining the sorted property.
+     *
+     * @param item
+     */
+    public void insert(E item) {
+        SingleLinkedNode<E> node = head, curr = node;
+
+        do {
+            if (node.item.compareTo(item) > 0) { // new node is to be inserted before head
+                // last node should now point to the new head
+                while (curr.next != head) {
+                    curr = curr.next;
+                }
+                head = new SingleLinkedNode<>(item, node);
+                curr.next = head;
+                return;
+            } else if (node.next.item.compareTo(item) > 0) {
+                node.next = new SingleLinkedNode<>(item, node.next);
+                return;
+            } else if (node.next == head) {
+                node.next = new SingleLinkedNode<>(item, head);
+                return;
+            }
+            node = node.next;
+        } while (node != head);
+    }
+
+    public static void main(String a[]) {
+        InsertInSortedCircularLinkedList<Integer> linkedList = new InsertInSortedCircularLinkedList<>();
+        linkedList.add(00);
+        linkedList.add(11);
+        linkedList.add(22);
+        linkedList.add(33);
+        linkedList.printList();
+        linkedList.insert(-2);
+        linkedList.insert(9);
+        linkedList.insert(44);
+        linkedList.printList();
+    }
+}

src/me/ramswaroop/linkedlists/InsertInSortedList.java

@@ -13,7 +13,8 @@
 public class InsertInSortedList<E extends Comparable<E>> extends SingleLinkedList<E> {
 
     /**
-     * Insert an element in the sorted linked list.
+     * Inserts an element in the sorted linked
+     * list maintaining the sorted property.
      *
      * @param item
      */

src/me/ramswaroop/linkedlists/IntersectionOf2SortedLists.java

@@ -10,7 +10,7 @@
  * @date: 6/27/15
  * @time: 11:13 AM
  */
-public class IntersectionOf2SortedLists<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class IntersectionOf2SortedLists {
 
     /**
      * Returns a linked list with elements common in

src/me/ramswaroop/linkedlists/IntersectionOfTwoLists.java

@@ -10,7 +10,7 @@
  * @date: 6/18/15
  * @time: 10:34 PM
  */
-public class IntersectionOfTwoLists<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class IntersectionOfTwoLists {
 
 
     /**

src/me/ramswaroop/linkedlists/IsIdentical.java

@@ -10,7 +10,7 @@
  * @date: 6/29/15
  * @time: 9:42 AM
  */
-public class IsIdentical<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class IsIdentical {
 
     /**
      * Returns {@code true} if linked list {@param list1} and {@param list2}

src/me/ramswaroop/linkedlists/MergeTwoSortedLists.java

@@ -10,7 +10,7 @@
  * @date: 6/27/15
  * @time: 8:47 PM
  */
-public class MergeTwoSortedLists<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class MergeTwoSortedLists {
 
     /**
      * Merges two sorted list {@param list1} and {@param list2} into

src/me/ramswaroop/linkedlists/MiddleNode.java

@@ -10,7 +10,7 @@
  * @date: 6/18/15
  * @time: 10:34 PM
  */
-public class MiddleNode<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class MiddleNode {
 
     public static <E extends Comparable<E>> SingleLinkedNode<E> getMiddleNode(SingleLinkedList<E> list) {
         SingleLinkedNode<E> slow = list.getNode(0);

src/me/ramswaroop/linkedlists/MoveLastNodeToFirst.java

@@ -10,7 +10,7 @@
  * @date: 6/23/15
  * @time: 7:52 PM
  */
-public class MoveLastNodeToFirst<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class MoveLastNodeToFirst {
 
     public static <E extends Comparable<E>> void moveLastNodeToFirst(SingleLinkedList<E> list) {
         if (list.size <= 1) return;

src/me/ramswaroop/linkedlists/NthNodeFromLast.java

@@ -10,7 +10,7 @@
  * @date: 6/18/15
  * @time: 6:49 PM
  */
-public class NthNodeFromLast<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class NthNodeFromLast {
 
     public static <E extends Comparable<E>> SingleLinkedNode<E> getNthNodeFromLast(SingleLinkedList<E> list, int n) {
         SingleLinkedNode<E> slow = list.getNode(0);

src/me/ramswaroop/linkedlists/RemoveDuplicates.java

@@ -13,7 +13,7 @@
  * @date: 6/18/15
  * @time: 2:35 PM
  */
-public class RemoveDuplicates<E extends Comparable<E>> extends SingleLinkedList<E> {
+public class RemoveDuplicates {
 
     /**
      * Removes duplicates from a sorted linked list

src/me/ramswaroop/linkedlists/ReverseDoubleLinkedList.java

@@ -10,7 +10,7 @@
  * @date: 6/19/15
  * @time: 9:24 AM
  */
-public class ReverseDoubleLinkedList<E extends Comparable<E>> extends DoubleLinkedList<E> {
+public class ReverseDoubleLinkedList {
 
     /**
      * Reverses the doubly linked list.