Free JavaScript Example Codes

This Javascript will accept a string of letters as input and determine how many ways those letters can be rearranged, ignoring non-unique combinations caused by repeat letters.any ways those letters can be rearranged, ignoring non-unique combinations caused by repeat letters. As well, at the user’s request, this program will recursively calculate and print each of these combinations.

For example, an input of "abc" will return that 6 possible combinations exist, and that they are "abc, acb, bac, bca, cab, cba".

Download from: Homepage