package recursion;

import static lib.IO.*;
import static lib.Rand.*;
import static lib.Mergesort.*;

import java.util.Arrays;

public class MergesortIncomplete {

	public static void main(String[] args) {
		int[] array = createIntArray(10, 0, 100);
		int[] array2 = array.clone();
		Arrays.sort(array2);
		
		println("Unsorted array");
		println(array);
		
		int[] sorted = mergesort(array);
		println("Sorted array");
		println(sorted);
		
		if (Arrays.equals(sorted, array2))
			println("Congratulations! Your sorting algorithm seems to be correct!");
		else {
			println("Your sorting algorithm produced:");
			println(sorted);
			println("But it should be:");
			println(array2);
		}

	}
	
	public static int[] mergesort(int[] array) {
		// TODO
		// edit *only* this part of the program
	}
	
}