Count sort and Insertion Sort

Completed code for Count sort and Insertion Sort. Quicksort still needs
	to be implemented.
Sorts operate on a list of Edges. This list is generated in slightly
	different ways for the matrix and list and are the main
	differentiator for their runtimes.