Write program to test union data types.
Implementation of the radix sort and its associated unit test.

Radix sort algorithm from exercise 35 done. Currently without
documentation or defensive programming steps. Will add
in next commit
Update documentation to make radix_sort more explicit.

Add two comments to the radix_sort, clarifying parts of the code.
Change minor whitespace around +/-/
Add support for potential efficiency gain in future.
Change printf's in profiling unit test to log_infos.

All printfs in the test used for showing the average time spent
inside of a function changed to log_info, so that the information
can be viewed in a cleaner fashion.
Implement dynamic array algorithms with default C functions.

Note: While xubuntu has qsort implemented by default in its libraries
It does not have mergesort or heapsort as part of its default functions.
Merge and heapsort are stub functions which use qsort and stub return values
in their implementation.