Randomize a List problem

[ijabbott]

(09-15-2020 09:47 AM)Werner Wrote:  

(09-14-2020 11:41 PM)Albert Chan Wrote:  ≪ t 2. FOR n n RAND × CEIL ROLL t ROLLD -1 STEP t ➝LIST ≫

or, the other way round:
≪ 1. t FOR n t ROLL n RAND × CEIL ROLLD NEXT t ➝LIST ≫

Cheers, Werner

Those two are the classic Fisher-Yates shuffle algorithm, with the ROLL and ROLLD exchanging two items at specified stack positions. Is there a more efficient way to swap stack elements?