This program will accept three strings from the command line. A file name to read in a file, a prefix length and an output word count. It uses a a linked hash table created by myself to using strings(prefix) as keys and using a linked list as the structure as the values. The file will be read word by word and stored. Next a hash table will be  constructed based on the prefix length as keys and followers as linked-lists.  The hash value will be based on a guaranteed prime number above the max table size.  The time it takes to build the table is printed to screen.  Then a random prefix is chosen and a random follower for that prefix is printed to screen.  That follower is then added to the prefix with the first prefix word deleted. This prefix  is then used to get another random follower and printed to screen. This repeats until  the output word count is met. The result is meant to be a mark shaneyesque type of algorithm.