i have no idea what mergesort cs3203402 was using but its definitely not the one i know about you can check speed of algorithm by unattatching the pink render from the end of merge this implementation uses insertionsort instead of an actually good merge so its actually pretty slow efficient divide and conquer sorting algorithm stable not adaptive space - O(n) time compl - O(nlogn)
