Write a gofer function merge that takes two increasing list of integers and merg

Question

Write a gofer function merge that takes two increasing list of integers and merge them into single increasing list(without any duplicate values)

Explanation / Answer

listReverse :: [Int] -> [Int] -> [Int] listReverse [] temp = temp listReverse (head : tail) temp = listReverse tail (head: temp) mergeHelp :: [Int] -> [Int] -> [Int]->[Int] mergeHelp [] [] temp = temp mergeHelp (head : tail) [] temp = mergeHelp tail [](head : temp) mergeHelp [] (head : tail) temp = mergeHelp []tail (head : temp) mergeHelp (p : q) (a : b) temp | p a = mergeHelp( p :q) b (a : temp) mergeHelp (p : q) (a : b) temp = mergeHelp q b (p : temp) merger :: [Int] -> [Int] -> [Int] merger l m = listReverse (mergeHelp l m []) []

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.