Question

def minList(s: List[Int]): Int = s match { case Nil => 100 case h :: t => val m = minList(t) if (h < m) h else m case Nil => 0 }

          def minList(s: List[Int]): Int = s match {
case Nil => 100
case h :: t => val m = minList(t)
	if (h < m) h else m
case Nil => 0
}

Added by Dennis T.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Supreeta N

09/04/2023

Step 1

It does this by recursively calling the helper function `minTailRec` with the tail of the list (`t`) and the head of the list (`h`) as arguments. Show more…

Show all steps

Thanks for your feedback!

Texts: Tail recursion This function determines the minimum value of a non-empty list of integers (in the range 0-100 inclusive) using recursion: Rewrite this so that it uses tail recursion (maintaining the existing structure of the function). Instead of minList(List(4, 7, 3, 8)), how would the new function be called with this list? def minList(s:List[Int]) :Int = s match case Nil => 100 case h :: t => { def minTailRec(s: List[Int], m: Int): Int = s match { case Nil => m case x :: xs => minTailRec(xs, if (x < m) x else m) } minTailRec(t, h) }