3 ms·
Not the person you asked but 4! is the number of permutations of a list - it's commonly seen throughout CS theory and other forms of discrete math. log_2(n) i
by gpm 9y ago
Not the person you asked but
4! is the number of permutations of a list - it's commonly seen throughout CS theory and other forms of discrete math.
log_2(n) is the number of bits needed to store a integer from 0 to n - it's reasonably commonly used in CS theory education.