Skip to content

Instantly share code, notes, and snippets.

@brixen

brixen/gist:147153

Created July 14, 2009 20:06
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save brixen/147153 to your computer and use it in GitHub Desktop.
Save brixen/147153 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
gistfile1.txt
* Read doc/experiments/hash/results.txt and use the methodology below
* Write benchmarks for Array#sort
* Use a sensible set of Array sizes from 10 to 10,000
* For each size, provide a) random Fixnum values, b) semi-random, c) semi-sorted
* Define what semi-random and semi-sorted mean quantitatively
* Follow the Hash example and generalize the Array rubyspecs to use new_array
* Research and Implement a) bottom-up heap sort, b) mergesort, c) in-place mergesort
* Document the algorithms and the papers referred to
* Run the implementations against the specs
* Run the implementations against the benchmarks for both interpreted only and JIT
* Document the results
* Finish the implementation of Array#pack
* Finish the implementation of String#unpack
* Fix failing specs
* Run your own applications and write specs for rbx failures that don't have specs
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment