mergeSort.txt

  def mergeSort(input: Array[Int]): Array[Int] = {
    if (input.size == 1) {
      input
    } else {
      val mid = input.size / 2
      val (left, right) = input.splitAt(mid)
      merge(mergeSort(left), mergeSort(right))
    }
  }
  
  def merge(a: List[Int], b: List[Int]): List[Int] = {
    (a, b) match {
      case (x :: xs, y :: ys) =>
        if (x < y) x :: merge(xs, b)
        else y :: merge(a, ys)
      case (Nil, l) => l
      case (l, Nil) => l
      case (Nil, Nil) => Nil
    }
  }
  
  def main(args: Array[String]): Unit = {
    val res = mergeSort(List(1,8,4,6,3,8,6,0,8,54,3,5))
    println(res)
  }