JS function algorithm interview case

Write a function , It receives a numeric parameter num, The return value is the sum of all prime numbers not greater than this number .

Print all less than 10 The prime number of （ prime number ）, And then sum up （ Prime number ： Can only be 1 Divide with yourself ）

Problem solving ：

 function name(num) {

    //     var arr = 0;

    //     for (i = 2; i <= num; i++) {// although 1 It also meets the characteristics of prime numbers , however 1 Is a special number , So from 2 Start the cycle

    //       for (j = 2; j <= i; j++) {

    //         if (i % j == 0) {

    //           break;

    //         }

    //       }

    //       if (j == i) {

    //         arr += i;

 console.log(i);

    //       }

    //     }

    //     console.log(arr);

    //   }

    //   name(10);

All less than 10 The prime number of （ prime number ） by 2,3,5,7;

All less than 10 The prime number of （ prime number ） The result of the sum of is 17;