e.g.:
import java.util.Random; public class ControlRepetitionWithoutKeepingScore { public static void main(String []args) { int choices[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 }; int sz = choices.length; Random random = new Random(); for(int i = 0; i < choices.length; i++ ) { int pos = random.nextInt(sz); print(choices[pos]); choices[pos] = choices[sz-1]; sz--; } } }
Other entries:
- isPrime: Naive version
- isPrime, Optimization 1: Iterate only until the square root of the number
- isPrime, Optimization 2: Only divide by odd numbers, until the square root of the number
- isPrime, Optimization 3: Skip the divisors that are multiple of 2 or 3
- Keep the previosly generated primes and use them to test the following numbers.
- isPrime, Recursive.
No comments:
Post a Comment