Algorithm exercises--card games

There is a stack of cards on the table, from the first card (that is, the card at the top) starts from top to bottom numbered 1-n. Do the following: Throw away the first card, and then put the first piece of the experience to the end of the entire stack of cards. Enter n, output each time you discard the card, and the last remaining card.
For example, enter 7
Output 1357426


Realize:

function f (n) {var arr = new Array (); for (var i = 0;i < n; i++) {Arr.push (i+1);} var ret = new Array (), for (; arr.length > 1;) {var tothrow = Arr[0];arr.splice (0,1); Ret.push (Tothrow); var tolast = arr[0]; Arr.splice (0,1); Arr.splice (arr.length,1,tolast);} Ret.push (Arr[0]); return ret;} Console.log (f (7));

Algorithm exercises--card games