Skip to content

added GeneratePermutations in Backtracking #655

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

Merged
raklaptudirm merged 1 commit into from
Aug 18, 2021
Merged

added GeneratePermutations in Backtracking #655

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
33 changes: 33 additions & 0 deletions Backtracking/GeneratePermutations.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
/*
* Problem Statement: Generate all distinct permutations of a string/array (all permutations should be in sorted order);
*
* What is permutations?
* - Permutation means possible arrangements in a set (here it is string/array);
*
* Reference to know more about permutations:
* - https://www.britannica.com/science/permutation
*
*/

const swap = (arr, i, j) => {
const newArray = [...arr];

[newArray[i], newArray[j]] = [newArray[j], newArray[i]] // Swapping elements ES6 way

return newArray
}

const permutations = (arr, low, high) => {
if (low === high) {
console.log(arr.join(' '))
return
}
for (let i = low; i <= high; i++) {
arr = swap(arr, low, i)
permutations(arr, low + 1, high)
}
}

// Driver Code
const input = [1, 2, 3]
permutations(input, 0, input.length - 1)