dist-javascript-algorithms-and-data-structures
Version:
Algorithms and data-structures implemented on JavaScript
13 lines (10 loc) • 611 B
JavaScript
;
var _sieveOfEratosthenes = _interopRequireDefault(require("../sieveOfEratosthenes"));
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
describe('sieveOfEratosthenes', () => {
it('should find all primes less than or equal to n', () => {
expect((0, _sieveOfEratosthenes.default)(5)).toEqual([2, 3, 5]);
expect((0, _sieveOfEratosthenes.default)(10)).toEqual([2, 3, 5, 7]);
expect((0, _sieveOfEratosthenes.default)(100)).toEqual([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]);
});
});