0
I Use This!
Inactive
Analyzed about 5 hours ago. based on code collected about 5 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.

Tags

No tags have been added

In a Nutshell, GenPrime...

Quick Reference

BSD 4-clause (University of California-Specific)
Permitted

Commercial Use

Modify

Distribute

Place Warranty

Forbidden

Use Trademarks

Hold Liable

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...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog
  • ...
    65% of companies leverage OSS to speed application development in 2016
  • ...
    search using multiple tags to find exactly what you need

Languages

Languages?height=75&width=75
Make
20%
Perl
8%
Fortran (Free-format)
8%
11 Other
64%

30 Day Summary

Dec 20 2018 — Jan 19 2019

12 Month Summary

Jan 19 2018 — Jan 19 2019

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!