Skip to content

Added CartesianProduct.js #1082

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 6 commits into
base: master
Choose a base branch
from
Open

Added CartesianProduct.js #1082

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
6fff99d
Added cartesianProduct.js
xinzhe822 Aug 7, 2022
ee7ef67
Added CartesianProduct.test.js
xinzhe822 Aug 7, 2022
374df97
Solve import error
xinzhe822 Aug 7, 2022
2e9740e
Format code style
xinzhe822 Aug 7, 2022
8796336
Update CartesianProduct.js
itsvinayak Aug 25, 2022
6cd36d1
Update CartesianProduct.js
itsvinayak Aug 27, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 5 additions & 5 deletions Maths/CartesianProduct.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,13 +8,13 @@
const cartesianProduct = (setA, setB) => {
// Check if input sets are not empty.
if (!setA || !setB || !setA.length || !setB.length) {
return null
return {}
}
const product = []

for (let indexA = 0; indexA < setA.length; indexA += 1) {
for (let indexB = 0; indexB < setB.length; indexB += 1) {
product.push([setA[indexA], setB[indexB]])
for(let elementA of setA){
for(let elementB of setB){
product.push([ elementA, elementB])
}
}

Expand Down