File: random-sort

package info (click to toggle)
scheme9 2025.08.12-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 4,080 kB
  • sloc: lisp: 16,752; ansic: 11,869; sh: 806; makefile: 237; sed: 6
file content (9 lines) | stat: -rw-r--r-- 365 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
 
S9 LIB  (random-sort list)          ==>  list
        (random-sort list integer)  ==>  list

Create a random permutation of LIST and return it. When INTEGER
is specified, use it to initialize a random state (see RANDOM).
When no seed or the same seed is specified, RANDOM-SORT will
always deliver the same permutation.

(random-sort '(1 2 3 4 5))  ==>  (2 5 1 4 3)