Answer the question
In order to leave comments, you need to log in
Need a function to generate short names, how best to compose an algorithm?
There is an array with ordinary words, the word is the key of the array.
And in the value for each element you need to write the following:
a, b, c ... z,
ab, ac, ad ... za, zb, zc,
a1, a2, a3.. z7, z8, z9,
Whatever in as a result, get about 1k non-repeating, as short as possible letter combinations (+ then numbers when the letter combinations run out)
Answer the question
In order to leave comments, you need to log in
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question