Let\'s say I have three lists:Departments, Divisions, and Groups.A Department is made up of Divisions, which in turn is made up of Groups.
I have been trying to wrap my head around this for a while now but have not been able to come up with a good solution. Here goes:
Can somebody please demonstrate for me a more efficient Cartesian product algorithm than the one I am using currently (assuming there is one).I\'ve looked around SO and googled a bit but can\'t see an
加载中,请稍侯......