Added explaining comments to MergeSort()
Improved MergeSort()

-Will go through input two times. Each iteration does the following
	-Splits input into pairs of lists of first 1, then two elements
	-Merges the pairs into lists
	-Clears the container containing all lists and moves the
	elements from above into it
-The result of the algorithm will be a list with groups of 4 sorted
items
MergeSort now works properly (for multiples of 2)

-Will sort all elements correctly
-Will only work for list with size a multiple of 2 ( will be fixed in a
later commit )
MergeSort now works for inputs of any size

-Will work for inputs of any size
-Still prints some debugging info
-Needs more testing
Change data from vector to deque
Cleaned up code
Cleaned up MergeSort()

-Moved splitting list into pairs into separate function
-Function returns VecPair which the main loop adds to rhe result deque
-MergeSort() is now a lot shorter and easier to read.
Moved result into loop and removed call to clear
Added single pass of quick sort
Working QuickSort() helper function

-Function now does quick sort on an array for one pivot value
Added README