a single function that takes in an array of numbers and returns a new array containing the original array and the original array in every possible combination of sorting orders, minus any duplicates. Currently works with arrays of length 3 - 6 values. Any larger and the function is seriously inefficient and slow
-
Notifications
You must be signed in to change notification settings - Fork 0
a single function that takes in an array of primitive values and returns a new array containing the original array and the original array in every possible combination of sorting orders, minus any duplicates. Works with primitive and custom string or numeric data types (not arrays or objects)
License
brendangooch/every-combination
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
a single function that takes in an array of primitive values and returns a new array containing the original array and the original array in every possible combination of sorting orders, minus any duplicates. Works with primitive and custom string or numeric data types (not arrays or objects)
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published