cartesian-product

I have an array like [0,2,3,0,1] as input , and I need to find Cartesian product of {0}x{0,1,2}x{0,1,2,3}x{0}x{0,1} , more precisely I need to have output as following. Input: [0, 2, 3, 0, 1] Output: [0, 0, 0, 0, 0] [0, 0, 0, 0, 1] [0, 0, 1, 0, 0] [0, 0, 1, 0, 1] [0, 0, 2, 0, 0] [0, 0, 2, 0, 1] [0, 0, 3, 0, 0] [0, 0, 3, 0, 1] [0, 1, 0, 0, 0] [0, 1, 0, 0, 1] [0, 1, 1, 0, 0] [0, 1, 1, 0, 1] [0, 1, 2, 0, 0] [0, 1, 2, 0, 1] [0, 1, 3, 0, 0] [0, 1, 3, 0, 1] [0, 2, 0, 0, 0] [0, 2, 0, 0, 1] [0, 2, 1, 0, 0] [0, 2, 1, 0, 1] [0, 2, 2, 0, 0] [0, 2, 2, 0, 1] [0, 2, 3, 0, 0] [0, 2, 3, 0, 1] I need a general

I'm making a password brute forcing tool as a learning exercise, and I want it to be resumable. So, what I want is to be able to say, this is the set of possible characters, if I computed the Cartesian set of every possible combination of this set up to length n, what is the set at point x? However, I want to do this without computing the entire set. I've seen similar logic in one place online but I was unable to generalise this to fit. Any help would be fantastic, thanks! I'm fluent in C# if that helps. Edit: Here's the question I mentioned earlier: How to select specific item from cartesian

If I want to get the Cartesian Product of these two vector<string> s: vector<string> final{"a","b","c"}; vector<string> temp{"1","2"}; But I want to put the result in final , such that final would contain: a1 a2 b1 b2 c1 c2 I'd like to do this without creating a temporary array. Is it possible to do this? If it matters, the order of final is not important. You may try the following approach #include <iostream> #include <vector> #include <string> int main() { std::vector<std::string> final{ "a", "b", "c" }; std::vector<std::string> temp{ "1", "2" }; auto n = final.size(); final.resize( final

I have to compare coordinates in order to get the distance. Therefor i load the data with sc.textFile() and make a cartesian product. There are about 2.000.000 lines in the textfile thus 2.000.000 x 2.000.000 to be compared coordinates. I tested the code with about 2.000 coordinates and it worked fine within seconds. But using the big file it seems to stop at a certain point and i don't know why. The code looks as follows: def concat(x,y): if(isinstance(y, list)&(isinstance(x,list))): return x + y if(isinstance(x,list)&isinstance(y,tuple)): return x + [y] if(isinstance(x,tuple)&isinstance(y

I was asked in an interview to come up with a solution with linear time for cartesian product. I did the iterative manner O(mn) and a recursive solution also which is also O(mn). But I could not reduce the complexity further. Does anyone have ideas on how this complexity can be improved? Also can anyone suggest an efficient recursive approach? There are mn results; the minimum work you have to do is write each result to the output. So you cannot do better than O(mn) . The question that comes to my mind reading this is, "Linear with respect to what?" Remember that in mathematics, all variables

I am trying to figure how how to find all the combinations given the following information: I start with a JSON dataset: var choices = { 1: {'Q': 100, 'R': 150, 'W' : 250, 'T', 30}, 2: {'Q': 90, 'R': 130, 'W' : 225, 'T', 28}, 3: {'Q': 80, 'R': 110, 'W' : 210, 'T', 25}, 4: {'Q': 70, 'R': 90, 'W' : 180, 'T', 22}, 5: {'Q': 60, 'R': 70, 'W' : 150, 'T', 18}, 6: {'Q': 50, 'R': 50, 'W' : 110, 'T', 15}, 7: {'Q': 40, 'R': 30, 'W' : 80, 'T', 11}, 8: {'Q': 30, 'R': 25, 'W' : 50, 'T', 8}, 9: {'Q': 20, 'R': 10, 'W' : 25, 'T', 5}, 10: {'Q': 10, 'R': 5, 'W' : 15, 'T', 3} }; What I'm trying to figure out is

Please excuse my lack of better terminology. I have a string[] and I'd like to get the product of a catesian join with itself for later to put in a dictionary. However, I'd like all possible combinations except when there is a clone/duplicate key. string[] array1 = { "aa", "bb", "cc" }; string[][] arrayOfArrays = array1.SelectMany(left => array1, (left, right) => new string[] { left, right }).ToArray(); Will obtain a string[][] from all possible combinations yielding as each element: aa aa aa bb aa cc bb aa bb bb bb cc cc aa cc bb cc cc What I'm trying to understand here is what is the joining

Related Questions: Matrix Combination Logic Efficient way to determine the outcome of test matrix I have 25 individual validations that I need to test all possible combinations, I have seen a couple of questions related to what I'm looking for. The answers suggested something along the lines of using the cartesian product. Would that be the best method for finding the results I'm looking for or is there a better way? Example: Think about a 9 by 9 number grid starting from 0 - 9 on the X and Y axis: |0|1|2|3|4|5|6|7|8|9| |1| |2| |3| |4| |5| |6| |7| |8| |9| All the individual validations are