Tag Archives: mergesort

Merge Sort program in C

It is rather amazing, that many programmers are unable to write ‘Merge Sort’ correctly. With itsĀ guaranteeĀ of O(n log n) time complexity, it is a dependable sorting algorithm. Also it can be used to count number of inversions in an array … Continue reading

Posted in Programming | Tagged , , | 27 Comments