working in SeperateChainingHashST

Author: jb

SortingArray/src/searchingArray/FlexibleArray.java

@@ -3,10 +3,6 @@
 // An implementation of a flexible array, to add elements and to full array, by copying the existing size of an array
 public class FlexibleArray<T> {
 
- 
- 
- 
-
  private T[] oldArray = null;
  private T[] doubleArray = null;
  private int split = 0;

SortingArray/src/searchingArray/SeparateChainingHashST.java

@@ -1,11 +1,11 @@
 package searchingArray;
 
 
+//This basic symbol-table implementation maintains an array of linked lists, using a hash function to
+//choose a list for each key. 
 
 
-// HASH is map key to the index
-// building a linked list for each table
-public class SeparateChainingHashST<Key, Value> {
+public class SeparateChainingHashST<Key, Value> { // items that collide are chained together in separate linked lists.
 
  private int N; // number of key-value pairs
  private int M; // hash table size