find-prime-numbers-imperative.java

public void findPrimeNumbers() {
  List<Integer> numbers = new ArrayList<>();
  for (int i = 1; i < 101; i++) {
    numbers.add(i);
  }
  List<Integer> result = new ArrayList<>();
  for (Integer number : numbers) {
    if (isPrime(number)) {
      result.add(number);
    }
  }
  System.out.println(result.toString());
}