A recursion is a function which calls it self.
object Demo
{
def Sum(a: Int, b: Int): Int = {
if (a > b) 0
else {
var result = 0
for (number <- a to b)
result += number
result
}
}
def main(args:Array[String])
{
println(Sum(0, 10))
}
}
object Demo
{
def recursiveSum(a: Int, b: Int): Int = {
if (a > b) 0
else {
a + recursiveSum(a+1, b)
}
}
def main(args:Array[String])
{
println(recursiveSum(0, 10))
}
}
object Demo
{
def fact(n:Int): Int=
{
if(n == 1) 1
else n * fact(n - 1)
}
def main(args:Array[String])
{
println(fact(3))
}
}
object Demo
{
def sum(num: Int): Int=
{
if (num == 1) 1
else
sum(num - 1) + num
}
def main(args:Array[String])
{
println(sum(55))
}
}
Tail Recursion
import scala.annotation.tailrec
object Demo
{
def GCD(n: Int, m: Int): Int =
{
@tailrec def gcd(x:Int, y:Int): Int=
{
if (y == 0) x
else gcd(y, x % y)
}
gcd(n, m)
}
def main(args: Array[String]){
println(GCD(12, 18))
}
}
object Demo
{
def Sum(a: Int, b: Int): Int = {
if (a > b) 0
else {
var result = 0
for (number <- a to b)
result += number
result
}
}
def main(args:Array[String])
{
println(Sum(0, 10))
}
}
object Demo
{
def recursiveSum(a: Int, b: Int): Int = {
if (a > b) 0
else {
a + recursiveSum(a+1, b)
}
}
def main(args:Array[String])
{
println(recursiveSum(0, 10))
}
}
object Demo
{
def fact(n:Int): Int=
{
if(n == 1) 1
else n * fact(n - 1)
}
def main(args:Array[String])
{
println(fact(3))
}
}
object Demo
{
def sum(num: Int): Int=
{
if (num == 1) 1
else
sum(num - 1) + num
}
def main(args:Array[String])
{
println(sum(55))
}
}
Tail Recursion
import scala.annotation.tailrec
object Demo
{
def GCD(n: Int, m: Int): Int =
{
@tailrec def gcd(x:Int, y:Int): Int=
{
if (y == 0) x
else gcd(y, x % y)
}
gcd(n, m)
}
def main(args: Array[String]){
println(GCD(12, 18))
}
}
No comments:
Post a Comment