Code: C++

Specifications:

As you saw from your readings and exercises, Merge Sort is based upon the idea of divide-and-conquer. If implemented correctly, your merge sort algorithm should have a time complexity of O(n*log(n)). Your task for this lab is to write a program that utilizes a merge sort algorithm. It is up to you ( your choice ) as to how you want to utilize merge sort within your program, BUT the merge sort implementation MUST run in O(n*log(n)) time.