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

20 votes148 views3 answers
Replace string java online
Java
3 votes163 views2 answers
Java vs python
Java
5 votes143 views2 answers
Explain JDK, JRE and JVM?
Java
0 vote150 views1 answer
New date api in java 8
Java
0 vote135 views1 answer
Math.log java
Java
0 vote163 views1 answer
Webmvctest vs springboottest
Java Spring
4 votes193 views10 answers
Array
Java
0 vote150 views1 answer
Javafx change application title
Java
1 vote133 views1 answer
Show confirmation dialog java android
Java
1 vote99 views1 answer
Java botton code
Java