归并排序

package suanfazuoye_3;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;

public class mergeSort {
	 
    BufferedReader br = null;
    BufferedWriter bw = null;
    static String[] array = null;
     
    public mergeSort() throws IOException{
        br = new BufferedReader(new FileReader(new File("E:"+File.separator+"largeW.txt")));
        bw = new BufferedWriter(new FileWriter(new File("f:"+File.separator+"largeW_merge.txt ")));
    }
   //归并排序
    public String[] mergesort(String[] arrs){
    	if(arrs.length < 2){
    		return arrs;
    	}
    	int middle = arrs.length % 2 == 0 ? arrs.length / 2 :(arrs.length-1)/2;
    	
    	String[] left = Arrays.copyOfRange(arrs, 0, middle);
    	String[] right = Arrays.copyOfRange(arrs, middle, arrs.length);
    	
    	String[] lres = mergesort(left);
    	String[] rres = mergesort(right);
    	return merge(lres,rres);
    }
	private String[] merge(String[] lres,String[] rres){
    	String[] res = new String[lres.length + rres.length];
    	int l = 0;
    	int r = 0;
    	int c = 0;
    	
    	while(l < lres.length && r < rres.length){
    		if (Double.parseDouble(lres[l]) < Double.parseDouble(rres[r])) {
     		 res[c++] = lres[l++];
     	   }else{
     		   res[c++] = rres[r+1];
     	   }
    	}
    	if(l == lres.length ){
    		while(r < rres.length){
    			res[c++] = rres[r++];
    		}
    		return res;
    	}
    	if(r == lres.length ){
    		while(l < lres.length){
    			res[c++] = lres[l++];
    		}
    		return res;
    	}
    	
    	return res;
    }

    //输出已经排好序的数据的文件
    public void setArray() throws IOException{
        String tmp = "";
        for(int r = 0;r < array.length;r++){
            tmp = array[r] + ",";
            bw.write(tmp);
            tmp = "";
        }
        bw.close();
    }
  //获取文件中的数据
    public String[] getArray() throws IOException{
        String  tmp[] = new String[1000000];
        int num = 0;
        while(br.read() != -1){
            tmp[num] = br.readLine();
//            System.out.println(tmp[num]);
            num++;
        }
        tmp = Arrays.copyOf(tmp, num);
        br.close();
        return tmp;
    }
     
    public static void main(String[] args) throws IOException {
    	mergeSort test = new mergeSort();
        array = test.getArray();
        test.mergesort(array);
        test.setArray();
    }
}


 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值