Submission for the Linked List Lab

src/Node.java~

@@ -0,0 +1,41 @@
+/**
+ * This class represents a single node in a linked list.  The data stored
+ * in the node is immutable, but the next field can be modified.
+ */
+public class Node
+{
+  private String name;
+  private int quantity;
+  private Node next;
+
+  /**
+   * Create a node with the specified name and quantity.  The next field will
+   * be null.
+   */
+  public Node(String itemName, int itemQuantity)
+  {
+    name = itemName;
+    quantity = itemQuantity;
+    next = null;
+  }
+
+  public String getNadme()
+  {
+    return name;
+  }
+
+  public int getQuantity()
+  {
+    return quantity;
+  }
+
+  public Node getNext()
+  {
+    return next;
+  }
+
+  public void setNext(Node newNext)
+  {
+    next = newNext;
+  }
+}

src/SortedLinkedList.java

@@ -34,7 +34,24 @@ public void print()
    */
   public String getName(int index)
   {
+    Node temp = head;
+    int count = 0;
+    String tempName = "";
+    while(temp != null){
+      if(count == index)
+      {
+        tempName = temp.getName();
+        return tempName;
+      }
+      else{
+        count++;
+      }
+      temp = temp.getNext();
+    }
 
+    return null;
+
+
   }
 
   /**
@@ -44,15 +61,40 @@ public String getName(int index)
    */
   public int getQuantity(int index)
   {
-
+   Node temp = head;
+   int count = 0;
+   int tempQuan = 0;
+   while(temp != null){
+     if(count == index){
+       tempQuan = temp.getQuantity();
+       return tempQuan;
+     }
+     else{
+       count++;
+     }
+     temp = temp.getNext();
+   }
+   return -1;
   }
 
   /**
    * This method will return the number of elements currently held in the list.
    */
   public int length()
   {
+    int count = 0;
+    Node temp = head; 
+    if(temp == null)
+    {
+      return count;
+    }
+    while(temp != null)
+    {
+      count++;
+      temp = temp.getNext();
+    }
 
+    return count;
   }
 
   /**
@@ -61,15 +103,97 @@ public int length()
    */
   public boolean isMember(String name)
   {
+   Node temp = head;
+   String tempName = "";
+   while(temp != null){
+     tempName = temp.getName();
+     if(name == tempName)
+     {
+       return true;
+     }
+     else{
+       temp = temp.getNext();
+     }
+   }
 
+    return false;
   }
 
-  /**
-   * This method will add the specified name/quantity to the list in sorted
-   * order.  This order is specified by the quantity from low to high.
-   */
+//  public void insert(String name, int quantity)
+//  {
+//    Node temp = head;
+//    if(temp == null){
+//      Node newNode = new Node(name, quantity);
+//      newNode.setNext(head);
+//      head = newNode;
+//    }
+//    else{
+//      Node newNode2 = new Node(name, quantity);
+//      if(temp.getQuantity() < newNode2.getQuantity()){
+//        newNode2.setNext(head);
+//        head = newNode2;
+//      }
+//      else{
+//        while(temp.getNext() != null){
+//          temp = temp.getNext();
+//        }
+//        temp.setNext(newNode2);
+//      }
+//    }
+
+//  } 
   public void insert(String name, int quantity)
   {
+    Node curr = head;
+    Node prev = null;
 
-  }  
+    if(curr == null){
+      Node newNode = new Node(name, quantity);
+      newNode.setNext(head);
+      head = newNode;
+    }
+
+    else{
+      Node newNode2 = new Node(name, quantity);
+      while(curr != null){
+        if(newNode2.getQuantity() > curr.getQuantity()){
+          if(prev == null){
+            Node newNode = new Node(name, quantity);
+            newNode.setNext(head);
+            head = newNode;
+            break;
+          }
+          else{
+          prev.setNext(newNode2);
+          newNode2.setNext(curr);
+          break;
+          }
+        }
+        if(newNode2.getQuantity() == curr.getQuantity()){
+          if(prev == null){
+            Node newNode = new Node(name, quantity);
+            newNode.setNext(head);
+            head = newNode;
+            break;
+          }
+          else{
+          prev.setNext(newNode2);
+          newNode2.setNext(curr);
+          }
+        }
+        prev = curr;
+        curr = curr.getNext();
+       }
+      if(curr == null){
+        prev.setNext(newNode2);
+      }
+    }
+
+  }
+
+//  newNode2.setNext(head);
+//  head = newNode2;
+//  temp.getQuantity() < newNode2.getQuantity()
+
 }
+