I have a programming assignment that I'm trying to complete. It deals with self organizing lists.
We have to implement three seperate heuristics: Move to Front, Count and one of our choosing.
I'm looking for the best performence out of the third one I choose. I was thinking of finding the value and then swapping it with a random value that comes before it in the list.
But I dont' think that's the best way to do it.