Update to Makefile
Refined verification and logging options.
Implemented hybrid sorting functions (insertion sort, qsort, merge sort, and heap sort)

In order to improve sorting efficiency for large linked-list data
structures, a technique of moving the liked list data into an array,
sorting the array, then repopulating the list has been implemented for
quick sort, merge sort, and heap sort. Insertion sort, since it’s
efficiency over the “big three” (as it were) is won in small lists due
to its lack of overhead, has been implemented in place, without a
transfer to an array prior to sorting.
Small type change in dsa_list_insert( ) signature.
Vector sorting algorithm skeletons written (quick sort, merge sort, and heap sort). Insertion sort fully implemented.
Some naming and type changes.
Small update to dsa_list testing framework to account for new sorting algorithms implemented.