https://github.com/ioedeveloper/permutation
An algorithm to find the number of possible arrangement of a range of values i.e (1 to nth term), in a set of k i.e (k number of values at a time).
https://github.com/ioedeveloper/permutation
Last synced: about 2 months ago
JSON representation
An algorithm to find the number of possible arrangement of a range of values i.e (1 to nth term), in a set of k i.e (k number of values at a time).
- Host: GitHub
- URL: https://github.com/ioedeveloper/permutation
- Owner: ioedeveloper
- Created: 2018-05-24T19:49:39.000Z (almost 7 years ago)
- Default Branch: master
- Last Pushed: 2018-05-24T20:07:38.000Z (almost 7 years ago)
- Last Synced: 2025-02-08T16:32:36.337Z (3 months ago)
- Language: TypeScript
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Permutation
An algorithm to find the number of possible arrangement of a range of values i.e (1 to nth term), in a set of k i.e (k number of values at a time).
# Technologies
Typescript
# IDE
Visual Studio Code
# Inspiration/Motivation
I wrote this piece of code to answer a question asked on Quora.
I hope it helps others also.