QUESTION 1: QUICKSORT ALGORITHM
In this question you are asked to implement the ‘quicksort’ algorithm in C. The program is required to open and read into memory an input file containing a large number of records showing web server statistics, once in memory the program should then use the quicksort algorithm to sort these records in numerically ascending order based on the IP address. Finally, the program should then output the sorted web server statistics to an output file (with the same name as the input file, but with the extension ‘.sorted’).
QUESTION 2: DEPTH FIRST SEARCH OF GRAPHS
In this question you are asked to implement the ‘depth first search’ algorithm in C. Your program is required to build an adjacency list that represents the following graph containing 9 nodes.
The order in which the nodes and arcs should be created is shown in the table below.
NODE: Arc1, Arc2, …
A: B, C
B: E, D
C: D, G
D: E, F
E: F, H
F: H, G
Your program is then required to traverse the graph using the depth first search recursive algorithm, starting from node A, printing the nodes as you go. Remember, that the nodes should only be visited (printed) once; even though there may be multiple arcs to that node.
Please call your C program a3q2.c which should include the main() and dfs() functions. You can write any other support functions as you like.