GenPrime

I Use This!

Inactive

Analyzed about 4 hours ago. based on code collected about 17 hours 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...

...
has had 61 commits made by 3 contributors
representing 975 lines of code
...
is mostly written in Python
with a very low number of source code comments
...
has a well established, mature codebase
maintained by nobody
with stable Y-O-Y commits
...
took an estimated 1 years of effort (COCOMO model)
starting with its first commit in November, 2008
ending with its most recent commit over 9 years ago

Quick Reference

Project Links:

Download

Code Locations:

https://github.com/tycho/genprime

Similar Projects:

Managers:

Steven Noonan

Licenses

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.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
...
learn about Open Hub updates and features on the Open Hub blog
...
55% of companies leverage OSS for production infrastructure
...
you can embed statistics from Open Hub on your site