import java.awt.List;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.LineNumberReader;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Scanner;
public class mergeSort {
public static void main(String[] args) {
try {
long firstTime, endTime;//归并开始的时间与结束的时间;
int readNum;
FileReader f = new FileReader("C:/Users/Y470/Desktop/largeW.txt");
BufferedReader br = new BufferedReader(f);
ArrayList arraylist = new ArrayList();
String line = br.readLine();
while (line != null) {
readNum = Integer.parseInt(line.trim());
arraylist.add(readNum);
line = br.readLine();
}
int array[] = new int[arraylist.size()];//存放从文本读出来的数据
int arrayFnish[] = new int [arraylist.size()];//存放间接的数组
//把对象数组转化成整形数组
for(int i=0;i<array.length;i++){
array[i] = (Integer) arraylist.get(i);
}
firstTime = System.currentTimeMillis();//归并开始的时间
System.out.println("归并开始的时间"+firstTime);
mergeSort(array,arrayFnish,array.length-1);
endTime = System.currentTimeMillis();//归并结束的时间
System.out.println("归并结束的时间"+endTime);
System.out.println("归并排序所花费的时间:"+(endTime - firstTime)/1000.0+"秒");
//归并排序后写入到largeW_merge.txt中;
FileWriter ww = new FileWriter(
"C:/Users/Y470/Desktop/largeW_sort.txt");
BufferedWriter wMerge = new BufferedWriter(ww);
String str;
for (int i = 0; i < array.length; i++) {
str = String.valueOf(array[i]);
wMerge.write(str);
wMerge.newLine();
}
wMerge.flush();
wMerge.close();
br.close();
} catch (Exception e) {
e.printStackTrace();
}
}
public static void mergePass(int sourceArray[],int destArray[],int n,int h){
int i = 0;
while( i<= n-2*h){
merge(sourceArray,destArray,i,i+h-1,i+2*h-1);
i += 2*h;
}
if(i<n-h){
merge(sourceArray,destArray,i,i+h-1,n);
}else{
for(int k=i;k<=n;k++){
destArray[k] = sourceArray[k];
}
}
}
// 二路归并排序里面有两个mergePass,归并排序
private static void mergeSort(int[] sourceArray,int destArray[],int n) {
int h = 1;
while(h<n){
mergePass(sourceArray,destArray,n,h);
h = 2*h;
mergePass(destArray,sourceArray,n,h);
h = 2*h;
}
}
private static void merge(int[] sourceArray,int destArray[],
int first, int mid, int last) {
int i = first;
int j = mid + 1;
int k=first;
// 逐个归并
while(i <= mid && j <= last) {
if (sourceArray[i] <= sourceArray[j])
destArray[k++] = sourceArray[i++];
else
destArray[k++] = sourceArray[j++];
}
// 将左边剩余的归并
while (i <= mid) {
destArray[k++] = sourceArray[i++];
}
// 将右边剩余的归并
while ( j <= last ) {
destArray[k++] = sourceArray[j++];
}
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.LineNumberReader;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Scanner;
public class mergeSort {
public static void main(String[] args) {
try {
long firstTime, endTime;//归并开始的时间与结束的时间;
int readNum;
FileReader f = new FileReader("C:/Users/Y470/Desktop/largeW.txt");
BufferedReader br = new BufferedReader(f);
ArrayList arraylist = new ArrayList();
String line = br.readLine();
while (line != null) {
readNum = Integer.parseInt(line.trim());
arraylist.add(readNum);
line = br.readLine();
}
int array[] = new int[arraylist.size()];//存放从文本读出来的数据
int arrayFnish[] = new int [arraylist.size()];//存放间接的数组
//把对象数组转化成整形数组
for(int i=0;i<array.length;i++){
array[i] = (Integer) arraylist.get(i);
}
firstTime = System.currentTimeMillis();//归并开始的时间
System.out.println("归并开始的时间"+firstTime);
mergeSort(array,arrayFnish,array.length-1);
endTime = System.currentTimeMillis();//归并结束的时间
System.out.println("归并结束的时间"+endTime);
System.out.println("归并排序所花费的时间:"+(endTime - firstTime)/1000.0+"秒");
//归并排序后写入到largeW_merge.txt中;
FileWriter ww = new FileWriter(
"C:/Users/Y470/Desktop/largeW_sort.txt");
BufferedWriter wMerge = new BufferedWriter(ww);
String str;
for (int i = 0; i < array.length; i++) {
str = String.valueOf(array[i]);
wMerge.write(str);
wMerge.newLine();
}
wMerge.flush();
wMerge.close();
br.close();
} catch (Exception e) {
e.printStackTrace();
}
}
public static void mergePass(int sourceArray[],int destArray[],int n,int h){
int i = 0;
while( i<= n-2*h){
merge(sourceArray,destArray,i,i+h-1,i+2*h-1);
i += 2*h;
}
if(i<n-h){
merge(sourceArray,destArray,i,i+h-1,n);
}else{
for(int k=i;k<=n;k++){
destArray[k] = sourceArray[k];
}
}
}
// 二路归并排序里面有两个mergePass,归并排序
private static void mergeSort(int[] sourceArray,int destArray[],int n) {
int h = 1;
while(h<n){
mergePass(sourceArray,destArray,n,h);
h = 2*h;
mergePass(destArray,sourceArray,n,h);
h = 2*h;
}
}
private static void merge(int[] sourceArray,int destArray[],
int first, int mid, int last) {
int i = first;
int j = mid + 1;
int k=first;
// 逐个归并
while(i <= mid && j <= last) {
if (sourceArray[i] <= sourceArray[j])
destArray[k++] = sourceArray[i++];
else
destArray[k++] = sourceArray[j++];
}
// 将左边剩余的归并
while (i <= mid) {
destArray[k++] = sourceArray[i++];
}
// 将右边剩余的归并
while ( j <= last ) {
destArray[k++] = sourceArray[j++];
}
}
}