Data commit
This commit is contained in:
parent
7387c8f97b
commit
cb5bb5e222
199093 changed files with 3378972 additions and 0 deletions
1
Task/Fibonacci-sequence/Jq/fibonacci-sequence-1.jq
Normal file
1
Task/Fibonacci-sequence/Jq/fibonacci-sequence-1.jq
Normal file
|
|
@ -0,0 +1 @@
|
|||
nth_fib(pow(2;20)) | tostring | [length, .[:10], .[-10:]]
|
||||
4
Task/Fibonacci-sequence/Jq/fibonacci-sequence-2.jq
Normal file
4
Task/Fibonacci-sequence/Jq/fibonacci-sequence-2.jq
Normal file
|
|
@ -0,0 +1,4 @@
|
|||
def nth_fib_naive(n):
|
||||
if (n < 2) then n
|
||||
else nth_fib_naive(n - 1) + nth_fib_naive(n - 2)
|
||||
end;
|
||||
8
Task/Fibonacci-sequence/Jq/fibonacci-sequence-3.jq
Normal file
8
Task/Fibonacci-sequence/Jq/fibonacci-sequence-3.jq
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
def nth_fib(n):
|
||||
# input: [f(i-2), f(i-1), countdown]
|
||||
def fib: (.[0] + .[1]) as $sum
|
||||
| .[2] as $n
|
||||
| if ($n <= 0) then $sum
|
||||
else [ .[1], $sum, $n - 1 ]
|
||||
| fib end;
|
||||
[-1, 1, n] | fib;
|
||||
1
Task/Fibonacci-sequence/Jq/fibonacci-sequence-4.jq
Normal file
1
Task/Fibonacci-sequence/Jq/fibonacci-sequence-4.jq
Normal file
|
|
@ -0,0 +1 @@
|
|||
(range(0;5), 50) | [., nth_fib(.)]
|
||||
6
Task/Fibonacci-sequence/Jq/fibonacci-sequence-5.jq
Normal file
6
Task/Fibonacci-sequence/Jq/fibonacci-sequence-5.jq
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
[0,0]
|
||||
[1,1]
|
||||
[2,1]
|
||||
[3,2]
|
||||
[4,3]
|
||||
[50,12586269025]
|
||||
7
Task/Fibonacci-sequence/Jq/fibonacci-sequence-6.jq
Normal file
7
Task/Fibonacci-sequence/Jq/fibonacci-sequence-6.jq
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
def fib_binet(n):
|
||||
(5|sqrt) as $rt
|
||||
| ((1 + $rt)/2) as $phi
|
||||
| (($phi | log) * n | exp) as $phin
|
||||
| (if 0 == (n % 2) then 1 else -1 end) as $sign
|
||||
| ( ($phin - ($sign / $phin) ) / $rt ) + .5
|
||||
| floor;
|
||||
8
Task/Fibonacci-sequence/Jq/fibonacci-sequence-7.jq
Normal file
8
Task/Fibonacci-sequence/Jq/fibonacci-sequence-7.jq
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
# Generator
|
||||
def fibonacci(n):
|
||||
# input: [f(i-2), f(i-1), countdown]
|
||||
def fib: (.[0] + .[1]) as $sum
|
||||
| if .[2] == 0 then $sum
|
||||
else $sum, ([ .[1], $sum, .[2] - 1 ] | fib)
|
||||
end;
|
||||
[-1, 1, n] | fib;
|
||||
Loading…
Add table
Add a link
Reference in a new issue