def remove_occurences[T](xs:List[T], elem: T, n:Int) : List[A]  = {}

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 18PE
icon
Related questions
Question

def remove_occurences[T](xs:List[T], elem: T, n:Int) : List[A]
 = {}

Using the function above, can you show me how to make a polymorphic function in scala where the program removes elem , n number of times from the list. If n > elem then remove all elem from the list

For example:

remove_occurences(List(4,5,6,7,4),4,1) -> List(5,6,7,4)
remove_occurences(List(4,5,6,7,4),4,2) -> List(5,6,7)
remove_occurences(List(4,5,6,7,4),2,2) -> List(4,5,6,7,4)

Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Operations of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning