History.txt at 1305bc70319d446eb847398c9fae63f6eb838694 from briandoll's greatest_common_factor

briandoll / greatest_common_factor

Description:	Privides gcf features on arrays of integers edit
Homepage:	edit
Public Clone URL:	git://github.com/briandoll/greatest_common_factor.git Give this clone URL to anyone. `git clone git://github.com/briandoll/greatest_common_factor.git`
Your Clone URL:	git@github.com:briandoll/greatest_common_factor.git Use this clone URL yourself. `git clone git@github.com:briandoll/greatest_common_factor.git`

correcting README

briandoll (author)

Fri Oct 10 16:11:56 -0700 2008

commit 1305bc70319d446eb847398c9fae63f6eb838694
tree 9454aa73410a3161de731152659f495fbd51cb01
parent bdfb217c943e8961e160b4ed5d81af752a6d3a69

greatest_common_factor / History.txt

100644 10 lines (8 sloc) 0.262 kb

raw blame history

== 0.0.1 / 2008-09-19
* Initial release
 
== 0.0.2 / 2008-10.10
* Added speed improvements when dealing with arrays containing a large
spread of numbers
* Added benchmarking code to compare 2-digit array calculation with
basic ruby
* Added fuzzy gcf calculations