Farey sequence
- Subject: Farey sequence
- From: Adam Majewski
- Date: Wed, 16 Jun 2010 21:22:23 +0200
Hi,
It is my last comparison (including one lisp function) :
Farey(n) Evaluation took 1.3600 seconds
F(n) Evaluation took 0.0600 seconds
fc(n) Evaluation took 0.3400 seconds
fc2(n) Evaluation took 0.0300 seconds
fc3(n) Evaluation took 0.0500 seconds
ff(n) Evaluation took 0.0600 seconds
ff2(n) Evaluation took 0.0400 seconds
h(n) Evaluation took 0.0600 seconds
farey\-cauchy(n) Evaluation took 0.0900 seconds
n:5;
Farey(n) [4/5,3/5,2/5,1/5,3/4,1/4,2/3,1/3,1/2,0,1]
F(n) {0,1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5,1}
fc(n)[[1,5],[1,4],[1,3],[2,5],[1,2],[3,5],[2,3],[3,4],[4,5],[1,1]]
fc2(n) [[0,1],[1,5],[1,4],[1,3],[2,5],[1,2],[3,5],[2,3],[3,4],[4,5],[1,1]]
fc3(n) [0,1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5,1]
ff(n) {0,1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5,1}
ff2(n) {0,1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5,1}
h(n) {0,1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5,1}
farey\-cauchy(n) 0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1/1
Adam