scala数据结构和算法-04-快速排序实现

发布一个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

import scala.collection.mutable.ListBuffer
import scala.collection.mutable.ListBuffer

object QuickSort {
  
  def quickSort[T<% Ordered[T]](source:ListBuffer[T],left:Int,right:Int):ListBuffer[T]={
    if(left==right)ListBuffer()
    else{
      val index=partition(source,left,right)
      if(left==index){
         if(right-index>=2){
           quickSort(source,index+1,right)
         }
      }else if(right==index){
        if(index-left>=2){
          quickSort(source,left,index-1)
        }
      }else{
        if(index-left>=2){
          quickSort(source,left,index-1)
        }
        if(right-index>=2){
          quickSort(source,index+1,right)
        }
      }
     
      source
    }
  }
  
  def partition[T<%Ordered[T]](source:ListBuffer[T],left:Int,right:Int):Int={
      val cmp=source(left)
      var leftIndex=left
      var rightIndex=right
      var direction=true;
      while(leftIndex<rightIndex){
        if(direction){
          if(source(rightIndex)<cmp){ 
            source(leftIndex)=source(rightIndex);
            leftIndex+=1;
            direction=(!direction);
          }else{
            if(leftIndex<rightIndex){
              rightIndex-=1;
            }
          }
        }
        if(!direction){
          if(source(leftIndex)>=cmp){
            source(rightIndex)=source(leftIndex)
            rightIndex-=1
            direction=(!direction);
          }else{
            if(leftIndex<rightIndex){
              leftIndex+=1;
            }
          }
        }
        
      }
      source(leftIndex)=cmp;
      leftIndex
  }
  
  
  def main(args: Array[String]): Unit = {
    val source=ListBuffer(1,3,7,5,4,15,3,9,6,8,33,12,14,12,17,16,18);
     println(quickSort(source,0,source.length-1).mkString(","))
  }
}