Assignment

This assignment has to have a working jsfiddle, please either create a working jsfiddle and provide a link to it or separate the HMTL and Javascript

The first step of this assignment will be to create a List. You may use any List that you have already created. For the purposes of this assignment, it does not matter if your list is a doubly linked list of a singly linked list. I recommend that if you created a good useful list in the previous lists assignment use this list.

Your list will be a little different in that it will have 2 content properties. I recommend calling them contentA and contentB.

The next step will be to fill the contentA and contentB list with actual content. ContentA will be filled with a random string or number. You may select a string of any length. ContentB will be filled with a Hash of ContentA. You may choose any simple hash function and apply it.

You can select from a list of Hash Function -

You must document the name and source of your hash function in the comments of your code. This should be relatively easy once you implement your hash function. (Hint: Google simple Hash functions, you will find plenty)

ContentB = HashFunction(ContentA); (note that some Hash function accept additional "seed" parameters)

Your List should contain 10 nodes. Use a loop to create it.

Once you have filled in all the ContentA and ContentB values you will create an object (similar to a Node) that contains (1) ContentB - the hashed value and (2) A pointer to the node it came from for each of the 10 nodes in the list. These objects will be placed into an array. This is your index. You will sort the array on these values (you may use the built-in array functions).

Here is the sample input and output.

The output of Create List would look something like this (horizontal or vertical)

78

23

65

54

17

97

11

47

The output of the Adler 32 bit hash for the input values would be as shown

78	23	65	54	17	97	11	47
00a80070	00990066	00a3006c	00a0006a	009b0069	00ab0071	00950063	00a1006c

Each value of the Hash function maintains a pointer to the value that created it. You do this by simply having a specific pointer in your construction of the List when you created it (you could call the pointer source). The results of sorting the Hash list and then the output could look something like this

00950063->11

00990066->23

009b0069->17

00a0006a->54

00a1006c->47

00a3006c->65

00a80070->78

00ab0071->97