Task Exercises

Task 2.

Exercises:

1. 
   To avoid doubling the workspace needed when arrays are sorted with merge sort, it may be better to use a linked list of data instead of an array. In what situations is this approach better? Implement this technique and discuss its complexity.
   
2. 
   Write a rudimentary link program to check whether all variables have been initialized and whether local variables have the same names as global variables. Create a linked list of global variables and, for each function, create a linked list of local variables. In both lists, store information on the first initialization of each variable and check if any initialization has been made before a variable is used for the first time. Also, compare both lists to detect possible matches and issue a warning if a match is found. The list of local variables is removed after the processing of one function is finished and created a new when a new function is encountered. Consider the possibility of maintaining alphabetical order on both lists.