Prime Checker

  • [deleted]
    + 1 comment

    Can improve

    for (int i = 2; i < (num/2)+1; i++){
                if (num%i==0){
                    return false;
                }
            }
    

    as

    for (int i = 2; i*i <= num; i++){
                if (num%i==0){
                    return false;
                }
            }
    

    will be faster