This needs twice as much memory, though (temporarily, for building the intermediate list).
Usually, this won't be an issue, but it might be relevant when dealing with huge arrays, in order to limit peak memory usage.
In reply to Re^3: Create dynamically different array names based on counter incrementation
by Anonyrnous Monk
in thread Create dynamically different array names based on counter incrementation
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |