In Sidef, the Cartesian product of an arbitrary number of arrays is built-in as Array.cartesian():
cartesian([[1,2], [3,4], [5,6]]).say
cartesian([[1,2], [3,4], [5,6]], {|*arr| say arr })
Alternatively, a simple recursive implementation:
func cartesian_product(*arr) {
var c = []
var r = []
func {
if (c.len < arr.len) {
for item in (arr[c.len]) {
c.push(item)
__FUNC__()
c.pop
}
}
else {
r.push([c...])
}
}()
return r
}
Completing the task:
say cartesian_product([1,2], [3,4])
say cartesian_product([3,4], [1,2])