Moved sieve-of-eratosthenes to Typescript

Author: aliaks-ei

src/seive-of-eratosthenes/README.md renamed to src/sieve-of-eratosthenes/README.md

@@ -1,14 +1,14 @@
-# Seive of Eratosthenes
+# Sieve of Eratosthenes
 
 ## Description
 
 The _Sieve of Eratosthenes_ is a simple algorithm for finding all of the [prime numbers](https://en.wikipedia.org/wiki/Prime_number) up to a certain limit.  
 
 ## Implementation
 
-**_sieveOfEratosthenes(num)_** should return an array of all prime numbers up to the ```num```.
+`sieveOfEratosthenes(num)` should return an array of all prime numbers up to the `num`.
 
-For example:
+Example:
 
 ```
 sieveOfEratosthenes(20) // [2, 3, 5, 7, 11, 13, 17, 19]

src/seive-of-eratosthenes/seive-of-eratosthenes.spec.js renamed to src/sieve-of-eratosthenes/index.spec.ts

@@ -1,6 +1,6 @@
-const sieveOfEratosthenes = require('./seive-of-eratosthenes');
+import sieveOfEratosthenes from ".";
 
-describe('Seive of Eratosthenes:', () => {
+describe('Sieve of Eratosthenes:', () => {
   test('should return all prime numbers up to 13', () => {
     const primeNumbersArray = [2, 3, 5, 7, 11, 13];
 
@@ -13,10 +13,6 @@ describe('Seive of Eratosthenes:', () => {
     expect(sieveOfEratosthenes(27)).toEqual(primeNumbersArray);
   });
 
-  test('should return an empty array if no number passed', () => {
-    expect(sieveOfEratosthenes()).toEqual([]);
-  });
-
   test('should return an empty array if negative number passed', () => {
     expect(sieveOfEratosthenes(-5)).toEqual([]);
   });

src/seive-of-eratosthenes/seive-of-eratosthenes.js renamed to src/sieve-of-eratosthenes/index.ts

@@ -1,6 +1,6 @@
-function sieveOfEratosthenes(num) {
-  const primes = [];
-  const result = [];
+function sieveOfEratosthenes(num: number): number[] {
+  const primes: boolean[] = [];
+  const result: number[] = [];
 
   for (let i = 0; i <= num; i ++) {
     primes[i] = true;
@@ -15,9 +15,7 @@ function sieveOfEratosthenes(num) {
     }
   }
 
-  const primesLength = primes.length;
-
-  for (let i = 0; i < primesLength; i++) {
+  for (let i = 0; i < primes.length; i++) {
     if (primes[i]) {
       result.push(i);
     }
@@ -26,4 +24,4 @@ function sieveOfEratosthenes(num) {
   return result;
 }
 
-module.exports = sieveOfEratosthenes;
+export default sieveOfEratosthenes;