Analyzed
41 minutes
ago.
based on code collected
42 minutes
ago.
Project Summary
GenPrime is a very simple discovery algorithm to find prime numbers.
This particular variant is a programming language benchmark, using simple arithmetic, loops, and operators. This essentially acts as a stress test for the most fundamental features of any programming language, showing the deeply seated weaknesses of interpreted languages. There are currently implementations in C, C++, Java, Objective-C, Perl, PHP, Python, and Ruby.
In a Nutshell, GenPrime...
- ...
- ...
- ...
-
...
took an estimated 1 years of effort (COCOMO model)
starting with its first commit in November, 2008
ending with its most recent commit almost 10 years ago
Quick Reference
https://github.com/tycho/genprime
BSD 4-clause (University of California-Specific)
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Hold Liable
Use Trademarks
Required
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
learn about Open Hub updates and features on the Open Hub blog
-
...
use of OSS increased in 65% of companies in 2016
-
...
compare projects before you chose one to use
30 Day SummaryMar 3 2025 — Apr 2 2025
|
12 Month SummaryApr 2 2024 — Apr 2 2025
|
