# Merging two sorted lists in Scala

Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.

# Merging two sorted lists in Scala

less than 1 minute read

This post elucidates the power of programming in Scala. We describe how to merge two sorted lists into a third sorted list in Scala. Although there are built-in methods to perform this form of sorting, here, we shall use pattern matching and recursion to solve the problem.

``````def merge(i:List[Int], j:List[Int]):List[Int]={
(i,j) match {
case (Nil, Nil) => Nil
case (x::xs, Nil) => i
case (Nil, y::ys) => j
case (x::xs, y::ys) => {
if (x <= y)
x :: merge(i.tail,j)
else
y :: merge(i,j.tail)
}
}
}

val i = List(1,4,7,9)
val j = List(3,4,5,11,12,14)
merge(i,j)
``````

Output upon running the above code in Scala:

``````i: List[Int] = List(1, 4, 7, 9)
j: List[Int] = List(3, 4, 5, 11, 12, 14)
res0: List[Int] = List(1, 3, 4, 4, 5, 7, 9, 11, 12, 14)
``````

Programming in Scala is simple and elegant, isn’t it?