Program in 'c' to implement merge sort.

2views

written 3.8 years ago by

pradnyanabar2613 ★ 5.2k

Merge sort is a sorting algorithm that uses the divide, conquer and combine algorithm paradigm.

A] Divide: It means partitioning the n-element array to be sorted into two sub arrays of n/2 elements in each sub-array.

B] conquer: It means sorting the two arrays recursively using merge sort.

C] combine: …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT