Closed mxkopy closed 2 years ago
Tests 50% faster using
t = rand(1:n) a = collect(1:n) @time f = collect( permutations_( a, t ) ) @time g = collect( permutations( a, t ) ) print( mapreduce( x -> x in f, &, g ) )
t = rand(1:n)
a = collect(1:n)
@time f = collect( permutations_( a, t ) )
@time g = collect( permutations( a, t ) )
print( mapreduce( x -> x in f, &, g ) )
Tests 50% faster using
t = rand(1:n)a = collect(1:n)@time f = collect( permutations_( a, t ) )@time g = collect( permutations( a, t ) )print( mapreduce( x -> x in f, &, g ) )