This was from another forum:
http://cboard.cprogramming.com/showthread.php?t=94849Any O(n) running time list accessor is fundamentally wrong, as it encourages writing horribly inefficient code.
I'm not sure I completely understand what "running time list accessor" means or why it's bad if it becomes more efficient than (n). Which brings me to my last question... what is (n) in this case?