Question

Write a recursive Haskell function named listDiv that gets a list of integers and an integer number as parameters and returns a list that contains the elements of the parameter list that are divisible by the integer parameter. The function will return an empty list if the parameter list is empty. Examples: listDiv [10..40] 7 will return [14, 21, 28, 35], listDiv [] 7 will return []. Hint: Use the mod Haskell function. In the main program, test your listDiv function with a list and also with an empty list Part-3: List: [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44] Elements divisible by 7: [28, 35, 42] Elements divisible by 7 in an empty list: []

          Write a recursive Haskell function named listDiv that gets a list of integers and an integer number as parameters and returns a list that contains the elements of the parameter list that are divisible by the integer parameter. The function will return an empty list if the parameter list is empty. Examples: listDiv [10..40] 7 will return [14, 21, 28, 35], listDiv [] 7 will return []. Hint: Use the mod Haskell function.
In the main program, test your listDiv function with a list and also with an empty list
Part-3: List: [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44] Elements divisible by 7: [28, 35, 42] Elements divisible by 7 in an empty list: []

write a recursive haskell function named listdiv that gets a list of integers and an integer number as parameters and returns a list that contains the elements of the parameter list that are 48092

Added by Mark W.

Question

Please give Ace some feedback