Optimal LINQ query to get a random sub collection - Shuffle

Just needed to do that today. Here's my stab at it:

public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> enumerable)
    => enumerable.Shuffle(new Random());
    
private static IEnumerable<T> Shuffle<T>(this IEnumerable<T> enumerable, Random random)
    => enumerable
       .Select(t => (t, r: random.Next())) // zip with random value
       .OrderBy(tr => tr.r)
       .Select(tr => tr.t);

The main idea here is the "zip" but without using Zip since we only want to iterate the enumerable once. Inside the sort, each element of the original enumerable has the same "value".