Leo Vasconcelos leonamtv

## MergeSort.cpp
#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void merge(int *array, int low, int mid, int high)
{

## QuickSort.cpp
#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void quickSort(int *array, int low, int high)
{
	#include <iostream>

	void printArray(int *array, int n)
	{
	for (int i = 0; i < n; ++i)
	std::cout << array[i] << std::endl;
	}

	void merge(int *array, int low, int mid, int high)
	{