Assignment
This assignment asks you to develop a doubly linked list which will be used to sort the words in an input file and print the sorted words to an output file (or standard output) which will be the solution. Your program, called doublesort, will take the following command line arguments: % doublesort [-d] [-o output_file_name] input_file_name
Read the words in from the input file one at a time. Convert all the letters to lower case. Skip any punctuation or special characters. If the output_file_name is given with the -o option, the program will output the sorted words to the given output file; otherwise, the output shall be to standard output.
In addition to parsing and processing the command line arguments, your program needs to do the following:
A. You need to construct a doubly linked list as you read from input. Each node in the list will link to the one in front of it and the one behind it if they exist. They will have NULL for the previous pointer if they are first in the list. They will have NULL for the next pointer if they are last in the list. You can look up doubly linked lists in your Data Structure textbook.
B. Initially the list is empty. The program reads from the input file one word at a time and converts it to lower case. Develop a node with a pointer to the word and 2 pointers to nodes, previous and next. Initially the previous and next pointers should be NULL.
C. As long as you continue reading words, if the word is not already in the list, develop a new node and place the node into the list in the proper alphabetical order. If there is a node in front of it, adjust the next pointer of that node to point to the new node and make the previous pointer of the new node to point to the node in front of it. If there is a node after it then adjust those pointers as well so the list remains continuous. All duplicate words are ignored.
D. An end of file would indicate the end of input from the input file.
E. Once the program has read all the input, the program then performs a traversal of the doubly linked list first to last, or last to first if the -d option is set, to print one word at a time to the output file or stdout. Print one word per line.
F. Before the program ends, it must reclaim the list! You can perform this task by going through the list and freeing all nodes. This can be done in either direction.
G. It is required that you use getopt for processing the command line and use malloc or calloc and free functions for dynamically allocating and deallocating nodes.