Merge-Sort ChoforJr · COMPLETED
A significant part of computer science is dedicated to sorting data. An algorithm which uses the ‘divide and conquer’ approach of recursion is able to reduce a sorting problem to smaller and smaller sub-problems. Merge sort is one such sorting algorithm, and can be much faster than other algorithms such as bubble sort on the right data sets.
github.com/ChoforJr/Merge-Sort · ★ 1 · Forks 0 · Size 2 KB
SUMMARY
Technologies 2
Scored 2
Observed 2
Practices 6
Evidence 2
Skips 0
COVERAGE
Analyzed 2 files · 3 commits · 0 API calls
TECHNOLOGIES & DEPTH
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
JavaScript LANGUAGE Depth 70
1 files · PRODUCTION
PRACTICES
documentation · observedautomated_tests · absentcontinuous_integration · absentcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2025-02-12
Last commit 2025-09-11
Active months 2
Commits 3