aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Time for an 2014 update…

Browse source
This commit is contained in:
Ingy döt Net 2014-01-17 05:32:22 +00:00
parent 372c577f83
commit 09687c4926
2520 changed files with 34227 additions and 7318 deletions
Download patch file Download diff file Expand all files Collapse all files

24
Task/Hofstadter-Q-sequence/AWK/hofstadter-q-sequence.awk
View file

@ -1,22 +1,22 @@
#!/usr/bin/awk -f
BEGIN {
N = 100000;
print "Q-sequence(1..10) : " Qsequence(10);
Qsequence(N,Q);
print "1000th number of Q sequence : " Q[1000];
N = 100000
print "Q-sequence(1..10) : " Qsequence(10)
Qsequence(N,Q)
print "1000th number of Q sequence : " Q[1000]
for (n=2; n<=N; n++) {
if (Q[n]<Q[n-1]) NN++;
if (Q[n]<Q[n-1]) NN++
}
print "number of Q(n)<Q(n+1) for n<=100000 : " NN;
print "number of Q(n)<Q(n+1) for n<=100000 : " NN
}
function Qsequence(N,Q) {
Q[1] = 1;
Q[2] = 1;
seq = "1 1";
Q[1] = 1
Q[2] = 1
seq = "1 1"
for (n=3; n<=N; n++) {
Q[n] = Q[n-Q[n-1]]+Q[n-Q[n-2]];
seq = seq" "Q[n];
Q[n] = Q[n-Q[n-1]]+Q[n-Q[n-2]]
seq = seq" "Q[n]
}
return seq;
return seq
}

9
Task/Hofstadter-Q-sequence/Julia/hofstadter-q-sequence-1.julia Normal file
View file

@ -0,0 +1,9 @@
function Q(n)
N = maximum(n)
q = Array(Int, N)
q[1], q[2] = 1, 1
for i = 3:N
q[i] = q[i - q[i-1]] + q[i - q[i-2]]
end
return q[n]
end

15
Task/Hofstadter-Q-sequence/Julia/hofstadter-q-sequence-2.julia Normal file
View file

@ -0,0 +1,15 @@
julia> Q(1:10)
10-element Array{Int64,1}:
1
1
2
3
3
4
5
5
6
6
julia> Q(1000)
502

2
Task/Hofstadter-Q-sequence/Julia/hofstadter-q-sequence-3.julia Normal file
View file

@ -0,0 +1,2 @@
julia> sum(diff(Q(1:10^5)) .< 0)
49798