// Introduction to Algorithms
// Template for Mergesort.sort()
// <put your name, login name & student number here>

class Mergesort implements Sorting {

    // used for critical size to use insertion sort
    private int cutoff=0;
    public void cutoff (int n) { cutoff = n;}

    private Merging merger;
    private Sorting insertion_sorter; 

    public void choice (int c) { choice = c; }
    private int choice=0;

    public int[] sort (int[] array) {

    }

    public Mergesort () {
	merger = new Merge();
	insertion_sorter = new Insertion();
    }
    
}