merge_sort.cpp File Reference

Merege Sort Algorithm (MEREGE SORT) implementation More...

#include <iostream>

Include dependency graph for merge_sort.cpp:

Go to the source code of this file.

Functions
void	merge (int *arr, int l, int m, int r)
void	mergeSort (int *arr, int l, int r)
void	show (int *arr, int size)
int	main ()

Detailed Description

Merege Sort Algorithm (MEREGE SORT) implementation

Author

Ayaan Khan

Merge Sort is an efficient, general purpose, comparison based sorting algorithm. Merge Sort is a divide and conquer algorithm Time Complexity: O(n log n) It is same for all best case, worst case or average case Merge Sort is very efficient when for the small data. In built-in sort function merge sort along with quick sort is used.

Definition in file merge_sort.cpp.