public IList MergeSort(IList list)
{
    if (list.Count <= 1)
        return list;
 
    int mid = list.Count / 2;
 
    IList left = new ArrayList();
    IList right = new ArrayList();

private LinkedList<Element>MergeSort(LinkedList<Element> linkedList, string sortType) {
    if (linkedList.Count <= 1){
        return linkedList;
    }
 
    LinkedList<Element> left, right, result;
 
    int middle = linkedList.Count / 2;
 
    left = ReturnLinkedListSegment(0, middle, linkedList);