[Shootout-list] OCaml fibonacci entry

[Stephen Weeks]

The OCaml fibonacci entry is incorrect.  It uses an iterative loop to
compute the fibonacci numbers, while the test requires the usual naive
recursive approach.  It is pretty clear that something is wrong from
looking at the timing table, which shows OCaml as 30 times faster than
the next best language.

The original OCaml fibonacci entry (revision 1.1) was correct, so it
should be easy to fix this problem -- simply revert back to that
version.