Scala深入浅出实战经典：34,对List进行高效的排序和倒排序代码实战

package com.dt.scalaInAction.demo_034

/**
 * 对List进行高效的排序和倒排序代码实战
 */
object MergedSort {
    def main(args: Array[String]): Unit = {
        def mergedsort[T] (less: (T, T) => Boolean) (input: List[T]): List[T] = {
           /**
            * @param xList 要合并的有序列表
            * @param yList 要合并的有序列表
            * 
            * @return 合并后的列表
            */
            def merge(xList: List[T], yList: List[T]): List[T] =
               (xList, yList) match {
                  case (Nil, _) => yList
                  case (_, Nil) => xList
                  case (x :: xtail, y :: ytail) =>
                    if (less(x, y)) x :: merge(xtail, yList)
                    else y :: merge(xList, ytail)
            }
            
            val n = input.length / 2
            if (n == 0) input
            else {
                //吧要排序的列表input平均分成两个列表
                val (x, y) = input splitAt n
                //先后分后的两个列表归并排序，再对排好的有序列表进行归并
                merge(mergedsort(less)(x), mergedsort(less)(y))
            }
            
        }
        
        println(mergedsort((x: Int, y: Int) => x < y) (List(3, 7, 9, 5)))    //row result: List(3, 5, 7, 9)
        
        val reversed_mergedsort = mergedsort((x:Int, y: Int) => x > y) _
        println(reversed_mergedsort(List(3, 7, 9, 5)))                       //row result: List(9, 7, 5, 3)
      
    }
}