- 阶乘函数 [factorial]

- 斐波那契数列 [fibonacci]

- 全局唯一标识符

- [uuid]

- [guid]

- Twitter的雪花算法 [snowflake]

- LZ系列压缩算法

- LZ系列压缩算法均为LZ77与LZ78的变种，在此基础上做了优化。

- LZ77：LZSS、LZR、LZB、LZH；

- LZ78：LZW、LZC、LZT、LZMW、LZJ、LZFG。

- 其中，LZSS与LZW为这两大阵容里名气最响亮的算法。LZSS是由Storer与Szymanski [2]改进了LZ77：增加最小匹配长度的限制，当最长匹配的长度小于该限制时，则不压缩输出，但仍然滑动窗口右移一个字符。Google开源的Snappy压缩算法库大体遵循LZSS的编码方案，在其基础上做了一些工程上的优化。

- LRU

- 判断回文数

- 最长回文子串 https://www.cnblogs.com/en-heng/p/3973679.html

- 去掉重复值(数组)

- 找出字符串中出现次数最多的字母

- 求最大值、最小值

- 验证是否为数组

Node.js大众点评爬虫 https://www.cnblogs.com/en-heng/p/5895207.html

- lz77 算法

- https://www.jb51.net/article/23024.htm

- https://www.jb51.net/article/120912.htm

- 随机算法 random

- uuid

- 随机洗牌 knuth-shuffle

- http://caibaojian.com/js-random-array.html

- https://www.h5jun.com/post/array-shuffle.html

- http://caibaojian.com/get-random-element.html

- 5分钟现场撸代码——谈总结会抽奖程序 https://www.h5jun.com/post/luckey-draw-in-5-minutes.html

- Twitter的雪花算法 snowflake

重学前端 https://www.w3cplus.com/relearn-the-front-end-techniques.html

排序算法

第三届360前端星计划在线作业题

用65行代码实现JavaScript动画序列播放

为什么 [ ] 是 false 而 !![ ] 是 true

【十大经典数据挖掘算法】SVM系列 https://www.cnblogs.com/en-heng/p/5965438.html

别人家的面试题：不可变数组快速范围求和 https://75team.com/post/range-sum-query-immutable.html

别人家的面试题：自然数拆分求最大乘积 https://75team.com/post/integer-break.html

别人家的面试题：统计“1”的个数（续） https://75team.com/post/count_bits.html

HTML5 元素选择流程图

https://www.h5jun.com/post/multiply7.html 别人家的面试题：不用加减乘除，求整数的7倍

C4.5

K-Means

SVM

Apriori

EM

PageRank

AdaBoost

kNN

Naïve Bayes

CART

描述：一个正整数的阶乘是所有小于及等于该数的正整数的积，并且有`0`的阶乘为`1`。自然数`n`的阶乘写作`n!`。

阶乘函数是[递归(Haskell)函数](https://zh.wikibooks.org/zh/Haskell/%E9%80%92%E5%BD%92)典型示例

参考资料：

- https://www.w3cplus.com/javascript/factorial-function-in-javascript.html

version: 2

jobs:

build:

docker:

# specify the version you desire here

- image: circleci/node:8.11.1

# Specify service dependencies here if necessary

# CircleCI maintains a library of pre-built images

# documented at https://circleci.com/docs/2.0/circleci-images/

# - image: circleci/mongo:3.4.4

working_directory: ~/repo

steps:

- checkout

# Download and cache dependencies

- restore_cache:

keys:

- v1-dependencies-{{ checksum "package.json" }}

# fallback to using the latest cache if no exact match is found

- v1-dependencies-

- run: yarn install

- save_cache:

paths:

- node_modules

key: v1-dependencies-{{ checksum "package.json" }}

# run tests!

- run: yarn test

<p>

<a href="https://circleci.com/gh/jskit/kit-fibonacci/tree/dev"><img src="https://img.shields.io/circleci/project/jskit/kit-fibonacci/dev.svg" alt="Build Status"></a>

<a href="https://codecov.io/github/jskit/kit-fibonacci?branch=dev"><img src="https://img.shields.io/codecov/c/github/jskit/kit-fibonacci/dev.svg" alt="Coverage Status"></a>

</p>

使用 JavaScript 尽可能快地来计算斐波那契数列。

from https://github.com/jskit/kit-fibonacci

const assert = require('assert')

const fastfib = require('../lib/index')

assert.equal(fastfib(0), 0)

assert.equal(fastfib(1), 1)

assert.equal(fastfib(2), 1)

assert.equal(fastfib(3), 2)

assert.equal(fastfib(4), 3)

assert.equal(fastfib(5), 5)

assert.equal(fastfib(6), 8)

assert.equal(fastfib(7), 13)

assert.equal(fastfib(8), 21)

assert.equal(fastfib(9), 34)

assert.equal(fastfib(10), 55)

assert.equal(fastfib(11), 89)

assert.equal(fastfib(12), 144)

const assert = require('assert');

const suite = new (require('benchmark')).Suite;

const recurse = require('../lib/recurse');

const tail = require('../lib/tail');

const iter = require('../lib/iter');

.add('recurse', () => { recurse(20); })

.add('tail', () => { tail(20); })

.add('iter', () => { iter(20); })

.on('complete', function () {

console.log('result: ');

// console.log(this)

this.forEach((result) => {

console.log(result.name, result.count, result.times.elapsed);

});

assert.equal(

this.filter('fastest').map('name'),

'iter',

'expect iter to be the fastest',

);

})

.run();

{

"name": "kit-fibonacci",

"version": "1.0.2",

"description": "fastfib 使用 JavaScript 尽可能快地来计算斐波那契数列。",

"main": "lib/index.js",

"scripts": {

"prepublishOnly": "npm run lib",

"lib": "babel src -d lib",

"test": "node test/fastfib.spec.js && node benchmark"

},

"repository": {

"type": "git",

"url": "git+https://github.com/jskit/kit-fibonacci.git"

},

"keywords": [

"fibonacci",

"fastfib",

"kitjs"

],

"author": "cloudyan <[email protected]>",

"license": "MIT",

"bugs": {

"url": "https://github.com/jskit/kit-fibonacci/issues"

},

"homepage": "https://github.com/jskit/kit-fibonacci#readme",

"dependencies": {},

"devDependencies": {

"babel-core": "^6.26.0",

"babel-eslint": "^8.0.3",

"babel-plugin-add-module-exports": "^0.2.1",

"babel-plugin-transform-runtime": "^6.23.0",

"babel-preset-env": "^1.6.0",

"babel-preset-es2015": "^6.24.1",

"babel-preset-stage-2": "^6.24.1",

"benchmark": "^2.1.4"

}

}

import iter from './iter';

export default iter;

function iter(n) {

let current = 0;

let next = 1;

/* eslint no-plusplus: 0 */

for (let i = 0; i < n; i++) {

const swap = current;

current = next;

next = swap + next;

}

return current;

export default iter;

function recurse(n) {

if (n === 0) return 0;

if (n === 1) return 1;

return recurse(n - 1) + recurse(n - 2);

export default recurse;

function fib(n, current, next) {

if (n === 0) return current;

return fib(n - 1, next, current + next);

function tail(n) {

return fib(n, 0, 1);

export default tail;

import iter from './iter';

export default iter;

function iter(n: number): number {

let current = 0;

let next = 1;

/* eslint no-plusplus: 0 */

for (let i = 0; i < n; i++) {

const swap = current;

current = next;

next = swap + next;

}

return current;

export default iter;

function recurse(n: number): any {

if (n === 0) return 0;

if (n === 1) return 1;

return recurse(n - 1) + recurse(n - 2);

export default recurse;

function fib(n: number, current: number, next: number): any {

if (n === 0) return current;

return fib(n - 1, next, current + next);

function tail(n: number) {

return fib(n, 0, 1);

export default tail;

function iter(n: number): number {

let current = 0;

let next = 1;

/* eslint no-plusplus: 0 */

for (let i = 0; i < n; i++) {

const swap = current;

current = next;

next = swap + next;

}

return current;