ArrayList of prime numbers

import java.util.*;

public class test {
    public static void main(String[] args) {
        System.out.println(primeFinder(13));
    }

    public static ArrayList primeFinder(int n) {
        ArrayList<Integer> integerArray = new ArrayList<Integer>();
        
        for (int i = 1; i <= n; i++) {
            int count = 0;
            for (int j = i; j >= 1; j--) {
                if (i % j == 0) {
                    count++;
                }
            }
            if (count == 2) {
                integerArray.add(i);
            }
              
        }
        return integerArray;
    }
}

Similar codes

0 vote172 views1 answer
Log4j with spring boot restful services
Java Spring
6 votes136 views1 answer
Seconds to hours java
Java
0 vote156 views1 answer
Put in spring rest api
Java
0 vote132 views1 answer
ClassNotFoundException: org.springframework.ui.freemarker.FreeMarkerConfigurationFactory
Java
3 votes138 views2 answers
How to write to a txt file in java in the end
Java
-2 votes136 views2 answers
Create new empty list java
Java
0 vote146 views1 answer
Fibonacci for biginteger
Java
0 vote145 views1 answer
Mergesort parallelization using Spark
Java
2 votes173 views1 answer
How to pass enum in postman body
Java
0 vote141 views3 answers
Varargs java
Java