I'm programming a Snake game
var links = [elem_0, elem_1, ..., elem_n];
of elements representing links of the snake, then the way for the snake to move is to pop out elem_n, change its position to be that of the elem_0 plus the translation units dx and dy, and then put it at the beginning of the array:
[elem_0, elem_1, ..., elem_n] ---> [elem_n, elem_0, ..., elem_(n-1)]
(with some internal properties of elem_n changed in the process)
What is the way to do this that makes no compromise between
- optimally efficient in number of operations and memory usage
- clever (optional)
optimally efficient in number of operations and memory usage
You're asking for two optimisations that usually counter one another. e.g. more speed == more memory.
That said, I'd probably choose a (doubly) linked list to store my snake, because removal or addition at the front or tail are very cheap, and with games, faster is way preferable to less memory (within reason, but I wonder how long your snake would have to be before you run into memory issues... well beyond what's playable... and some).
Of course, I assume you've measured and found the standard array based methods to be too slow (seems unlikely).
You can rotate an array in two ways :
links.unshift(links.pop()); or links.push(links.shift());
first method solves your issue.