timeout-sort aeharding · PARTIAL
Timeout sort is an asynchronous integer sorting algorithm. It can sort all integers with O(max(input)+n).
github.com/aeharding/timeout-sort · ★ 5 · Forks 0 · Size 116 KB
SUMMARY
Technologies 5
Scored 4
Observed 4
Practices 6
Evidence 6
Skips 1
COVERAGE
Analyzed 5 files · 2 commits · 0 API calls
TECHNOLOGIES & DEPTH
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
JSON LANGUAGE Depth 70
1 files · PRODUCTION
JavaScript LANGUAGE Depth 70
2 files · PRODUCTION
npm BUILD_TOOL Depth 80
1 files · CONFIGURATION
Mocha TESTING Depth —
0 files · config only
PRACTICES
documentation · observedautomated_tests · observedcontinuous_integration · absentcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2015-08-04
Last commit 2015-11-12
Active months 2
Commits 2