Skip to content
ddandersonPublic

About

An implementation of the 3n+1 benchmark using Berkeley DB

Resources

Stars

5 stars

Watchers

2 watching

Forks

Latest commit

 

History

4 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 

Repository files navigation

This code implements the 3n+1 benchmark.  A description of the benchmark and results is on the libdb blog here:
  http://libdb.wordpress.com/2011/01/31/revving-up-a-benchmark-from-626-to-74000-operations-per-second/

About

An implementation of the 3n+1 benchmark using Berkeley DB

Resources

Stars

5 stars

Watchers

2 watching

Forks

Releases

Packages

Contributors

Languages