Logo

Programming-Idioms

This language bar is your friend. Select your favorite languages!
  • Go

Idiom #11 Pick a random element from a list

The list x must be non-empty.

A hand picking a random note in a hat 
func pick[T any](x []T) T {
	return x[rand.Intn(len(x))]
}

This generic function works for any type parameter T
import "math/rand"
x[rand.Intn(len(x))]
import "math/rand"
func pickT(x []T) T {
	return x[rand.Intn(len(x))]
}

Without generics: if you decide to implement pickT, you will have to write it separately for each desired type T.
with Ada.Numerics.Discrete_Random;
subtype Element_Type is Integer;
type List_Type is array (Positive range <>) of Element_Type;

function Pick_Random (X : List_Type) return Element_Type is
   subtype Index_Range  is Positive range X'Range;
   package Random_Index is new
     Ada.Numerics.Discrete_Random (Index_Range);
   Generator : Random_Index.Generator;
begin
   Random_Index.Reset (Generator);
   return X (Random_Index.Random (Generator));
end Pick_Random;
New implementation...
< > ⌨
programming-idioms.org 
func pick[T any](x []T) T {
	return x[rand.Intn(len(x))]
}
x[rand.Intn(len(x))]
func pickT(x []T) T {
	return x[rand.Intn(len(x))]
}
subtype Element_Type is Integer;
type List_Type is array (Positive range <>) of Element_Type;

function Pick_Random (X : List_Type) return Element_Type is
   subtype Index_Range  is Positive range X'Range;
   package Random_Index is new
     Ada.Numerics.Discrete_Random (Index_Range);
   Generator : Random_Index.Generator;
begin
   Random_Index.Reset (Generator);
   return X (Random_Index.Random (Generator));
end Pick_Random;
x[rand() % x_length];
(rand-nth x)
std::mt19937 gen;
std::uniform_int_distribution<size_t> uid (0, x.size () - 1);
x[uid (gen)];

std::ranges::sample(x, &result, 1, std::mt19937{std::random_device{}()});
x[Random.Shared.Next(x.Count)]
x[new Random().Next(x.Count)]
x.randomSample(1);
x[new Random().nextInt(x.length)];
Enum.random(x)

ktn_random:pick(X)
lists:nth(rand:uniform(length(X)), X).
call random_number (a)
x(lbound(x) + int(a*ubound(x))

x.shuffled().first()
(\l g -> l !! fst (randomR (0, length l) g))
(l !!) <$> randomRIO (0, length l - 1)
x[Math.floor(Math.random() * x.length)]
x[~~(Math.random() * x.length)];
if (!x.isEmpty()) {
    Random r = new Random();
    T t = x.get(r.nextInt(x.size()));
}
x.get((int)(Math.random()*x.size()))
x.get(ThreadLocalRandom.current().nextInt(0, x.size()))
list.random()
(nth (random (length x)) x)
x[math.random(#x)]
x[arc4random_uniform(x.count)]
$x[ array_rand($x) ]
element := x.Items[random(x.count)];
element := x[random(length(x))];

my @x = ('a', 'list', 'of', 'random', 'items');
print $x[rand @x];
random.choice(x)
if x: z = choice(x)
x.sample
let mut rng = rand::thread_rng();
let choice = x.choose(&mut rng).unwrap();
x[rand::thread_rng().gen_range(0..x.len())]
val x = List(1, 2, 3, 4)
x.apply(Random.nextInt(x.size))
(list-ref x (random (length x)))
x atRandom
x(Random.Shared.Next(x.Count))
x(New Random().Next(x.Count))