Merge Sort is of the order of n log n, which means the average running time is O (n log n). It is a comparison sort. The worst case memory requirement of Merge Sort is n. That is Merge Sort will take 80 bytes of storage to sort 10 numbers assuming 4 bytes are used to store a number. So it requires twice the memory to perform sorting when compared with another n log n sort called Quick Sort.
Click here to download the C Program to perform Merge Sort.
Click here to download the C++ Program to perform Merge Sort.
Click here to download the C++ Program to perform Merge Sort.
No comments:
Post a Comment