def sortList2(list: List[Long]): List[Long] =
        list match {
        case Nil => Nil
        case head :: tail =>
          val (before, after) = tail partition (_ < head)
          sortList2(before) ++ (head :: sortList2(after))
        }