Sorting a Linked List in O(NlogN) time using MergeSort
This program is a modification of a search program created in Spring 2002, it reads a file containing
1000 records, creates a linked list based on the data read and sorts the linked list database using
MergeSort.
The data file contains 1000 records but the program is able to select the amount of records to be sorted
(e.g., only 10, 100 or 500 instead of 1000).
Please select the quantity of records you wish to sort and click on "SORT AND TIME".