CSC 269 Programming Project. Mergesort.
Due date: midnight Tuesday, February 18.
Problem:
Use the algorithm mergesort to sort a file of integers.
Files Given:
LinkList.h
LinkNode.h
The use of these two files is optional.
Requirements:
You must use a linked list implementation of mergesort.
Your program must run with any input file consisting of a number of lines where each line contains one integer. The program must run correctly if the input file is empty.
All dynamic variables must be explicitly deleted.
The time complexity of your program must be O(n log n), where n is the number of lines of input.
Here is a sample input file.
the output file of my program.
The program must run correctly if the input file is empty. Here is my output if the input is the empty file.
Email
your files to Doina Bein, at siona@cs.unlv.edu.
Write "CSC 269 hw4: " in the subject field of your message.