algorithms/src/merge_sort_demo.cpp at develop · FindMeCoder/algorithms

Repository navigation

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

#include "generic.h"

#include "merge_sort.h"

using namespace alg;

int main()

{

const int MAX_ELEMENTS = 20;

int list[MAX_ELEMENTS];

int i = 0;

// generate random numbers and fill them to the list

for(i = 0; i < MAX_ELEMENTS; i++ ){

list[i] = rand()%100;

}

printf("The list before sorting is:\n");

printlist(list,MAX_ELEMENTS);

// sort the list using quicksort

merge_sort<int>(list,0,MAX_ELEMENTS-1);

// print the result

printf("The list after sorting using merge sort algorithm:\n");

printlist(list,MAX_ELEMENTS);

return 0;

}