合并排序-多线程算法

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

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

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

第二个视频发布  https://edu.youkuaiyun.com/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.youkuaiyun.com/course/detail/27574

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

 

package com.data.struct;

import java.util.concurrent.CountDownLatch;

public class CopyOfMultiThreadMergeSort2 {
	private static void mergeSort(int [] source,int left,int right,CountDownLatch cdl){
		if(left==right){
			cdl.countDown();
			cdl.countDown();
			return ;
		}else{
			int middle=(left+right)/2;
			MergeSortThread t1=new MergeSortThread(source,left,middle,cdl);
			t1.start();
			MergeSortThread t2=new MergeSortThread(source,middle+1,right,cdl);
			t2.start();
			try {
				cdl.await();
			} catch (InterruptedException e) {
				
			}
			
			int[]tmp=new int[right-left+1];
			int l=0;
			int lindex=left;
			int rindex=middle+1;
			for(;lindex<=middle;){
				if(rindex>right){
					break;
				}
				if(source[lindex]<source[rindex]){
					tmp[l++]=source[lindex];
					lindex++;
				}else{
					tmp[l++]=source[rindex];
					rindex++;
				}
			}
			if(lindex==middle+1&&rindex<=right){
				for(;rindex<=right;rindex++){
					tmp[l++]=source[rindex];
				}
			}
			if(rindex>right&&lindex<=middle){
				for(;lindex<=middle;lindex++){
					tmp[l++]=source[lindex];
				}
			}
			
			l=0;
			for(int x=left;x<=right;x++){
				source[x]=tmp[l++];
			}
			
			for(int i=0;i<source.length;i++){
				System.out.print(source[i]+" ");
			}
			System.out.println();
			
		}
		
	}
	
	private static class MergeSortThread extends Thread{
		private int[]A;
		private int p;
		private int r;
		private CountDownLatch cdl;
		public MergeSortThread(int[]A,int p,int r,CountDownLatch cdl){
			this.A=A;
			this.p=p;
			this.r=r;
			this.cdl=cdl;
		}
		@Override
		public void run() {
			CountDownLatch c=new CountDownLatch(2);
			mergeSort(A,p,r,c);
			try {
				c.await();
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
			
			this.cdl.countDown();
		}
		
		
	}
	public static void main(String[] args) {
		int[] data=new int[]{4,5,2,9,1,0,7};
		for(int i=0;i<data.length;i++){
			System.out.print(data[i]+" ");
		}
		System.out.println();
		CountDownLatch cd=new CountDownLatch(2);
		mergeSort(data,0,data.length-1,cd);;
		try {
			cd.await();
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
		for(int i=0;i<data.length;i++){
			System.out.print(data[i]+" ");
		}
		System.out.println();

	}

}