File: recursion.t

package info (click to toggle)
nqp 2016.12%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 7,960 kB
  • ctags: 3,884
  • sloc: java: 25,027; perl: 910; makefile: 12; sh: 2
file content (30 lines) | stat: -rw-r--r-- 580 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
puts "1..2"

def fact!(n)
    if n <= 1 then
       1
    else
       n * fact!(n - 1)
    end
end

result = fact!(6)
expected =  6*5*4*3*2

puts "#{result == expected ? 'ok' : 'nok'} 1 - sub recursion"

# ----------

class MethodRecursion
    def fibonacci(n)
        n <= 1  \
            ? n \
            : self.fibonacci( n - 1 ) + fibonacci(n - 2 ) 
## 2 styles:  ^^ explicit method call   ^^ implied method call
    end
end

fib = MethodRecursion.new.fibonacci(9)
expected2 = 34

puts "#{fib == expected2 ? 'ok' : 'nok'} 2 - method recursion"