{{ message }}
Algorithms are detailed sets of guidelines created for a computer program to complete tasks efficiently and thoroughly.
LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。)
Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.
ApacheCN 数据结构与算法译文集
A modular geospatial engine written in JavaScript
宇宙最强的前端面试指南 (https://lucifer.ren/fe-interview)
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
An incredibly fast JavaScript library for Delaunay triangulation of 2D points
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
A very fast geospatial point clustering library for browsers and Node.
Life is a moment
A very fast static spatial index for 2D points and rectangles in JavaScript
Data Structures and Algorithms using ES6
Web 端反爬技术方案
Simple algorithmic stock and option trading for Node.js.
A fast static index for 2D points
All algorithms writing with javascript in the book 'Algorithms Fourth Edition'.
The fastest spatial index for geographic locations in JavaScript
Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
It'd be neat to have a benchmark to test our diffing needs — perf is a feature, and we should be able to catch regressions.
Given this would need to run in the browser, we'd probably need some tooling around this. I was thinking it'd be cool to run a headless Chrome instance through puppeteer, and use the [nanobench](https://github.com/mafintosh/nano