scala-34：对List进行高效的排序和倒排序代码实战

内容：

1、对list进行排序实战

2、对list的倒排序实战

def main(args: Array[String]){
     
    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 {
      val (x, y) = input splitAt n<span style="white-space: pre;">			</span> //把要排序的列表input平均分成两个列表                                                     merge(mergedsort(less)(x),mergedsort(less)(y))   //先对分后的两个列表归并排序，再对拍好的列表进行归并   
 }
  }
    println(mergedsort((x: Int, y: Int) => x < y) (List (3, 7, 9, 5)))
    val reversed_mergedsort=mergedsort((x: Int, y: Int) => x > y) _
    println(reversed_mergedsort(List(3, 7, 9, 5)))<strong>
  </strong>