3 ms·
> In J we do this by creating a Boolean list, one value (0 or 1) per item of z Does the word "creating" here mean you can't do a relatively simple check across
by jancsika 7y ago
> In J we do this by creating a Boolean list, one value (0 or 1) per item of z
Does the word "creating" here mean you can't do a relatively simple check across array elements in J without allocating memory? E.g., soft realtime scheduling for such a simply operation is essentially just not possible in J?
- jonahx 7y agoI don't recall offhand the answer to this specific question, but many common operations in J are highly optimized under the hood. So even though you are doing "conceptually expensive" things, J will often implement them efficiently under the hood. J is quite fast, shockingly so for an interpreted language.