title: Linked List Array
body: <p>I have this school assignment that I'm a little confused about. </p>
  
  <p>Here's what it's saying: </p>
  
  <blockquote>
    <p>"Write a program that uses the technique of 'chaining' for hashing.
    The program will read in the length of an array which will contain the reference to each
    linked list that will be generated. Furthermore, all values that are to be stored, is read.
    The program shall have a separate function for hashing where the index exists. When the program have generated the linked lists, the theoretical 'load factor' is to be calculated and printed out. The whole array should be easily printed out." </p>
  </blockquote>
  
  <p>The thing that I'm confused about, is the part about the program will read in the length of an array which will contain the reference to each linked list that will be generated. Is it possible to generate multiple linked lists? In that case, how do you do that? </p>
  
  <p>This is the classes I'm told to use: </p>
  
  <pre><code>public class EnkelLenke { 
  
      private Node head = null; 
      private int numOfElements = 0; 
  
  
      public int getNum() 
      { 
          return numOfElements; 
      } 
  
      public Node getHead() 
      { 
          return head; 
      } 
  
      public void insertInFront(double value) 
      { 
          head = new Node (value, head); 
  
          ++numOfElements; 
      } 
  
      public void insertInBack(double value) 
      { 
          if (head != null) 
          { 
              Node this = head; 
  
              while (this.next != null) 
                  this = this.next; 
                  this.next = new Node(value, null); 
          } 
  
          else 
              head = new Node(value, null); 
              ++numOfElements; 
      } 
  
      public Node remove(Node n) 
      { 
          Node last = null; 
          Node this = head; 
  
          while (this != null &amp;&amp; this != n) 
          { 
              last = this; 
              this = this.next; 
          } 
  
          if (this != null) 
          { 
              if (last != null) 
                  last.next = this.next; 
              else 
                  head = this.next; 
                  this.next = null; 
                  --numOfElements; 
                  return this; 
          } 
  
          else 
              return null; 
      } 
  
      public Node findNr(int nr) 
      { 
          Node this = head; 
  
          if (nr &lt; numOfElements) 
          { 
              for (int i = 0; i &lt; nr; i++) 
                  this = this.next; 
  
              return this; 
  
          } 
  
          else 
              return null; 
      } 
  
      public void deleteAll() 
      { 
          head = null; 
          numOfElements = 0; 
      } 
  
      public String printAllElements() {
          String streng = new String();
  
          Node this = head;
          int i = 1;
  
          while(this != null)
          {
              streng = streng + this.element + " ";
              this = this.findNext(); 
  
              i++;
              if(i &gt; 5)
              {
                  i = 1;
                  streng = streng + "\n";
  
  
              }
  
          }
  
          return streng;
      } 
  
      public double getValueWithGivenNode (Node n) 
      {
  
          Node this = head; 
  
          while (this != null &amp;&amp; this != n) 
          { 
              this = this.next; 
          } 
  
          if (this == n) 
              return this.element;
          else 
              return (Double) null; 
  
      } 
  }
  
  public class Node { 
  
      double element; 
      Node next; 
  
      public Node(double e, Node n) 
      { 
          element = e; 
          next = n; 
  
      } 
  
      public double findElement() 
      { 
          return element; 
      } 
  
      public Node findNext() 
      { 
          return next; 
      }
  
  }
  </code></pre>