simple javacript function to find Prime Numbers between 0 to given number

findPrimeNumbers.js

/*
author : Pravin Mane.
sr. digital technologist @ExperienceCommerce Pvt. Ltd.

Live Demo: 
            http://jsfiddle.net/p4prawin/YS8M5/10/
*/

function getPrimeNumbers(tillVal) {
    var findTill = tillVal;
    var primeNoArray = [2, 3, 5, 7]; //prime nos between 1-10
    var flag = 1;
    for (var i = 7; i <= findTill; i++) {
        flag = 1;

        for (var k = 0; k < primeNoArray.length; k++) {
            if (i % primeNoArray[k] === 0) {
                flag = 0;
                break;
            }
        }

        if (flag == 1) {

            primeNoArray.push(" " + i);
        }
    }
    return primeNoArray;
   
}