scala数据结构和算法-02-用模式匹配实现合并排序

发布一个k8s部署视频：https://edu.csdn.net/course/detail/26967

课程内容：各种k8s部署方式。包括minikube部署，kubeadm部署，kubeasz部署，rancher部署，k3s部署。包括开发测试环境部署k8s，和生产环境部署k8s。

腾讯课堂连接地址https://ke.qq.com/course/478827?taid=4373109931462251&tuin=ba64518

第二个视频发布  https://edu.csdn.net/course/detail/27109

腾讯课堂连接地址https://ke.qq.com/course/484107?tuin=ba64518

介绍主要的k8s资源的使用配置和命令。包括configmap，pod，service，replicaset，namespace，deployment，daemonset，ingress，pv，pvc，sc，role，rolebinding，clusterrole，clusterrolebinding，secret，serviceaccount，statefulset，job，cronjob，podDisruptionbudget，podSecurityPolicy,networkPolicy,resourceQuota，limitrange，endpoint，event，conponentstatus，node，apiservice，controllerRevision等。

第三个视频发布：https://edu.csdn.net/course/detail/27574

详细介绍helm命令，学习helm chart语法，编写helm chart。深入分析各项目源码，学习编写helm插件
————————————————------------------------------------------------------------------------------------------------------------------

 

package data

object MergeSortUsePattern {
   def mergeSort[T](compatator:(T,T)=>Boolean)(source:List[T]):List[T]={
    source match{
      case list if (list.length==0)=>return List()
      case list if(list.length==1)=>return list;
      case _=>
    }
    val (left,right)=source.splitAt(source.length/2);
    merge(compatator)(mergeSort(compatator)(left),mergeSort(compatator)(right));
  }
  
  def merge[T](compatator:(T,T)=>Boolean)(left:List[T],right:List[T]):List[T]={
    (left,right)match{
      case (Nil,list)=>return list;
      case (list,Nil)=>return list;
      case (left,right)=>{
        if(compatator(left(0),right(0))){
          return left(0)::merge(compatator)(left.slice(1, left.length),right);
        }else{
          return right(0)::merge(compatator)(left,right.slice(1, right.length))
        }
        
      }
    }
  }
  
  def main(args: Array[String]): Unit = {
    val source=List(1,3,9,8,4,7,5,6)
    println(mergeSort[Int]((x,y)=>{ if (x<y)  true else  false})(source))
  }
}