I read that the permutation table in classic perlin noise uses values from 0 to 255. I want to know if the quantity of elements can be increased. I think it uses 256 values (0-255). I'm going to make my own table for my own version of the classic algorithm. In the algorithm I want to know if there is 1 of every count of elements like it would be from 0 to 255 if they were all integers in order (not skipping any whole number), basically I want to know if the count of elements in the array is e...
