So basically you already have an arbitrary list of 1000 numbers. That may or may not be prime? And you want to know how many are prime? (Let me know if I am wr

So basically you already have an arbitrary list of 1000 numbers. That may or may not be prime? And you want to know how many are prime? (Let me know if I am wrong) 1. Pick the highest number, H in the arbitrary list of 1000 numbers. 2. Generate all prime numbers up to the highest number, H. 3. Use e., Verb also known as member of to check for prime numbers present in arbitrary list. +/(all prime numbers up to H e. arbitrary list of 1000 numbers) will give you the number of items in the arbitrary list that are prime. > will J cleverly optimize away the i.1000 array? The primitives & verbs in array languages are designed to be as fast and efficient as possible. So even if your code is mediocre, it will perform better that any mediocre imperative code.