-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtutorial_5.scala
More file actions
90 lines (69 loc) · 1.32 KB
/
Copy pathtutorial_5.scala
File metadata and controls
90 lines (69 loc) · 1.32 KB
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
object Tutorial_5 {
def main(args: Array[String]) = {
print("Enter an Integer: ");
val num: Int = scala.io.StdIn.readInt();
println("Is prime: " + prime(num));
println("--------Prime Sequence--------");
primeSeq(num);
println("Sum: " + sum(num));
println("Is Even: " + isEven(num));
println("Is Odd: " + isOdd(num));
println("Sum of even numbers: " + evenSum(num));
println("--------Fibonnaci Sequence--------");
fibonacciSeq(num);
println();
}
def prime(n: Int, i: Int=2): Boolean = {
if (n<=1)
false
else if (n==i)
true;
else if (n%i==0)
false;
else
prime(n, i+1);
}
def primeSeq(num: Int, i: Int=2): Unit = {
if (i==num)
println();
else {
if (prime(i))
print(s"$i\t");
primeSeq(num, i+1);
}
}
def sum(num: Int): Int = {
if (num==0)
0
else
num + sum(num-1);
}
def isEven(n: Int): Boolean = n match {
case 0 => true
case _ => isOdd(n-1);
}
def isOdd(n: Int): Boolean = !(isEven(n));
def evenSum(n: Int): Int = {
if (n==0)
0
else{
if(n%2==1)
(n-1) + evenSum(n-3);
else
n + evenSum(n-2);
}
}
def fibonacci(n: Int): Int = {
if (n==0)
0
else if (n==1)
1
else
fibonacci(n-1) + fibonacci(n-2);
}
def fibonacciSeq(n: Int): Unit = {
if (n>0)
fibonacciSeq(n-1);
print(s"${fibonacci(n)}\t")
}
}