Khan.randRange(4, 8) SelfOrgMove_to_FrontPro.initJSAV(arr_size) SelfOrgMove_to_FrontPro.getSearch()

Your task in this exercise is to show the behavior for self organizing lists using the move to front method. You will need to demonstrate what happens when you search for the value search_value. You will need to manually redirect the pointers of the nodes to demonstrate what happens when a node that is being searched is found.

Move the node to the desired position if you would like to and then redirect the pointers accordingly. To move the node click on the body of the node and then press the buttons accordingly. To change a pointer, click on its box (on the right side of the node) to highlight it, then click on the node that you want it to point to.

[SelfOrgMove_to_FrontPro.userInput]
if (!SelfOrgMove_to_FrontPro.checkAnswer(arr_size) && !guess[0]) { return ""; // User did not click, and correct answer is not // initial array state } else { return SelfOrgMove_to_FrontPro.checkAnswer(arr_size); }

You want to reproduce the behavior of the self organizing list's move to front method. Try starting finding the value in the list.

Now you need to make it point to the correct node, and make the rest of the nodes point to the other acconrding nodes.