Lesson 34 - C++ Mergesort
Lesson 34 - C++ Mergesort
MERGELIST
Assignment:
2. Building the initial linked list from (file20.txt) should follow this logic. As each new piece
of data (Id/Inv pair) comes off the data file, it is placed at the beginning of the list.
Therefore, the first values read from the data file will end up last in the list. We do not want
to have two external pointers (first/last) to the linked list as used in Lesson 33. Instead, we
want only one pointer to the first node in the list.
3. The recursive merge sort algorithm will need the supporting algorithms of splitting and
merging lists.
Instructions: