From f4cbdd39cf846583ec179b2bea143e748a38486f Mon Sep 17 00:00:00 2001 From: Shubham Sah <42349247+shubhamsah@users.noreply.github.com> Date: Thu, 28 May 2020 11:40:03 +0530 Subject: [PATCH] Update and rename MERGENR.C to merge_sort_nr.c --- sorting/{MERGENR.C => merge_sort_nr.c} | 9 +++++++++ 1 file changed, 9 insertions(+) rename sorting/{MERGENR.C => merge_sort_nr.c} (64%) diff --git a/sorting/MERGENR.C b/sorting/merge_sort_nr.c similarity index 64% rename from sorting/MERGENR.C rename to sorting/merge_sort_nr.c index 3e32cad3d..624b7411e 100644 --- a/sorting/MERGENR.C +++ b/sorting/merge_sort_nr.c @@ -1,5 +1,14 @@ /* Program to demonstrate non recursive merge sort */ +/* Merge sort is an effective sorting algorithm which falls under divide and conquer paradigm and produces a stable sort. + Merge sort repeatedly breaks down a list into several sublists until each sublist consists of a single element and merging those + sublists in a manner that results into a sorted list. + +Bottom-Up Merge Sort Implementation: +The Bottom-Up merge sort approach uses iterative methodology. It starts with the “single-element” array, and combines two adjacent elements and +also sorting the two at the same time. +The combined-sorted arrays are again combined and sorted with each other until one single unit of sorted array is achieved. */ + #include void mergesort(int x[ ] , int n) ;