Farzad Yousefzadeh farskid

## JavaScript Sieve Of Atkin.js
function sieveOfAtkin(limit){
   var limitSqrt = Math.sqrt(limit);
   var sieve = [];
   var n;

   //prime start from 2, and 3
   sieve[2] = true;
   sieve[3] = true;

   for (var x = 1; x <= limitSqrt; x++) {

## i18n-express4-cookie-example.js
// usual requirements
var express = require('express'),
    cookieParser = require('cookie-parser'),
    i18n = require('i18n'),
    app = module.exports = express();

i18n.configure({
  // setup some locales - other locales default to en silently
  locales: ['en', 'ru', 'de'],


## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                farskid
                / keybase.md
            
            
              Created
              August 4, 2017 10:30
            
          
    Keybase proof

I hereby claim:

I am farskid on github.
I am farskid (https://keybase.io/farskid) on keybase.
I have a public key ASDf3J3qhJ_y_QkaxGwL65icVgcJz4divVFQFf8VT58Qxgo

To claim this, I am signing this object:

  
## recursive-version.js
function gcd(n, m) {
  if (!m) { return n; }
  return (m, n % m);
}

console.log(gcd(512, 1024)); // 256

## recursive-version.js
function recursiveRange(a, b) {
  if (a + 1 === b) {
    return [];
  }
  return [a + 1].concat(range(a + 1, b));
}

## recursive-version.js
function sumOfIntArray(array) {
  if (!array.length) {
    return 0;
  }
  return array.pop() + sumOfIntArray(array);
}

## recursive-version.js
function expo(num, power) {
  if (power === 1) return num;
  return num * expo(num, power - 1);
}

## recursive-version.js
function fibo(n) {
  if (n === 1) return 0;
  if (n === 2) return 1;
  return fibo(n - 1) + fibo(n - 2);
}

function fiboLogger(n) {
  if (n === 0) return [];
  return [fibo(n)].concat(fiboLogger(n-1));
}

## sort-asc.js
function sortAsc(array) {
  if (!array.length) {
    return [];
  }
  return array.splice(
    array.indexOf(
      Math.min.apply(null, array)
    ), 1)
    .concat(sortAsc(array));
}

## flatten.js
function flattenArray(array) {
  let result = [];
  array.forEach(function(item, i) {
    if (Array.isArray(item)) {
      result = result.concat(flattenArray(array[i]));
    }
    else {
      result = result.concat([item]);
    }
  });
	function sieveOfAtkin(limit){
	var limitSqrt = Math.sqrt(limit);
	var sieve = [];
	var n;

	//prime start from 2, and 3
	sieve[2] = true;
	sieve[3] = true;

	for (var x = 1; x <= limitSqrt; x++) {
	function gcd(n, m) {
	if (!m) { return n; }
	return (m, n % m);
	}

	console.log(gcd(512, 1024)); // 256
	function recursiveRange(a, b) {
	if (a + 1 === b) {
	return [];
	}
	return [a + 1].concat(range(a + 1, b));
	}
	function sumOfIntArray(array) {
	if (!array.length) {
	return 0;
	}
	return array.pop() + sumOfIntArray(array);
	}
	function expo(num, power) {
	if (power === 1) return num;
	return num * expo(num, power - 1);
	}
	function fibo(n) {
	if (n === 1) return 0;
	if (n === 2) return 1;
	return fibo(n - 1) + fibo(n - 2);
	}

	function fiboLogger(n) {
	if (n === 0) return [];
	return [fibo(n)].concat(fiboLogger(n-1));
	}
	function sortAsc(array) {
	if (!array.length) {
	return [];
	}
	return array.splice(
	array.indexOf(
	Math.min.apply(null, array)
	), 1)
	.concat(sortAsc(array));
	}
	function flattenArray(array) {
	let result = [];
	array.forEach(function(item, i) {
	if (Array.isArray(item)) {
	result = result.concat(flattenArray(array[i]));
	}
	else {
	result = result.concat([item]);
	}
	});