Skip to main content

C Program To Implement Merge Sort Algorithm.

Merge sort is based on divide and conquer method. It takes the list to be sorted and divide it in half to create two unsorted lists. The two unsorted lists are then sorted and merged to get a sorted list. The two unsorted lists are sorted by continually calling the merge-sort algorithm; we eventually get a list of size 1 which is sorted. The two lists of size 1 are then merged.

Best case: When the array is already sorted O(nlogn).
Worst case: When the array is sorted in reverse order O(nlogn).
Average case: O(nlogn).

Space Complexity: Extra space is required, because space complexity is O(n) for arrays and O(logn) for linked lists. 



Method 1:
#include<stdio.h>
#include<conio.h>

void merge(int [],int ,int ,int );
void merge_sort(int [],int ,int );

int main() {
int arr[30], i, size;

printf("\n\t------- Merge Sorting Method -------\n\n");
printf("Enter How Many Data You Want To Sort: ");
scanf("%d",&size);

if(size<=0) printf("\n\tWrong Input?\n");
else {

printf("\n");
for(i=0; i<size; i++) {
printf("(%d) Enter Data: ",i+1);
scanf("%d",&arr[i]);
}

merge_sort(arr,0,size-1);
printf("\n\n\t---- Sorting In Ascending Order ----\n\n");

for(i=0; i<size; i++)
printf(" %d ",arr[i]);
getch();
}}

void merge_sort(int arr[],int min,int max)
{
int mid;
if(min<max) {
mid=(min+max)/2;
merge_sort(arr,min,mid);
merge_sort(arr,mid+1,max);
merge(arr,min,mid,max);
}}

void merge(int arr[],int min,int mid,int max) {
int tmp[30];
int i,j,k,m;
j=min;
m=mid+1;

for(i=min; j<=mid && m<=max ; i++) {
if(arr[j]<=arr[m]) /* To sort in descending order, change <= to >= only. */ {
tmp[i]=arr[j];
j++;
}
else {
tmp[i]=arr[m];
m++;
}}

if(j>mid) {
for(k=m; k<=max; k++) {
tmp[i]=arr[k];
i++;
}}

else {
for(k=j; k<=mid; k++) {
tmp[i]=arr[k];
i++;
}}

for(k=min; k<=max; k++)
arr[k]=tmp[k];
}

Method 2:
#include<stdio.h>
#include<conio.h>

int tmp[50];
void merge(int,int,int);

void merge_sort(int min,int max) {
int mid;

if(min<max) {
mid=(min+max)/2;
merge_sort(min,mid);
merge_sort(mid+1,max);
merge(min,mid,max);
}}

void merge(int min,int mid,int max) {
int h,i,j,b[50],k;
h=min;
i=min;
j=mid+1;

while((h<=mid)&&(j<=max)) {

if(tmp[h]<=tmp[j]) /* To sort in descending order, change <= to >= only. */ {
b[i]=tmp[h];
h++;
}

else {
b[i]=tmp[j];
j++;
}
i++;
}

if(h>mid) {
for(k=j;k<=max;k++) {
b[i]=tmp[k];
i++;
}}

else {
for(k=h;k<=mid;k++) {
b[i]=tmp[k];
i++;
}}

for(k=min;k<=max;k++)
tmp[k]=b[k];
}

int main() {
int num, i;

printf("------------------------------------------------------------------\n");
printf("---------------------- Merge Sorting Method ----------------------\n");
printf("------------------------------------------------------------------\n\n");
printf("Enter How Many Data You Want To Sort: ");
scanf("%d",&num);

if(num<=0) printf("\n\tWrong Input?\n");
else {
printf("\nEnter %d Elements: ",num);

for(i=1;i<=num;i++)
scanf("%d",&tmp[i]);

merge_sort(1,num);
printf("\nAfter Sorting In Ascending Order: ");

for(i=1;i<=num;i++)
printf("%d ",tmp[i]);
getch();
}}

Method 3:
#include <stdio.h>
#include<conio.h>
#include <stdlib.h>

void merge (int *A, int a, int *B, int b, int *C) {
int i,j,k;
i = 0;
j = 0;
k = 0;

while (i < a && j < b) {
if (A[i] <= B[j]) /* To sort in descending order, change <= to => only. */ {
C[k] = A[i];
i++;
k++;
}

else {
C[k] = B[j];
j++;
k++;
}}

while (i < a) {
C[k]= A[i];
i++;
k++;
}

while (j < b) {
C[k]= B[j];
j++;
k++;
}} 

void merge_sort(int *A, int n) {
int i;
int *A1, *A2;
int n1, n2;

if (n < 2)
return;  

n1 = n / 2; 
n2 = n - n1;
A1 = (int*)malloc(sizeof(int) * n1);
A2 = (int*)malloc(sizeof(int) * n2);

for (i =0; i < n1; i++)
A1[i] = A[i];

for (i = 0; i < n2; i++)
A2[i] = A[i+n1];

merge_sort(A1, n1);
merge_sort(A2, n2);

merge(A1, n1, A2, n2, A);
free(A1);
free(A2);
}

int main(int argv, char** args) {
int i, n;
int *A;
char c;

printf("------------------------------------------------------------------\n");
printf("---------------------- Merge Sorting Method ----------------------\n");
printf("------------------------------------------------------------------\n\n");
printf("Enter How Many Data You Want To Sort: ");
scanf("%d", &n);

if(n<=0) printf("\n\tWrong Input?\n");
else {
A = (int *)malloc(sizeof(int) * n);

printf("\nEnter %d Elements: ",n);
for (i = 0; i < n; i++)
scanf("%d", &(A[i]));

merge_sort(A, n);
printf("\nAfter Sorting In Ascending Order: ");

for (i = 0; i < n; i++)
printf("%d ", A[i]);

free(A);
getch();
}}
Labels:

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  Screensaver,  Keyboard, Mouse,  Accessibility,  Power M
Read more

Java: The Complete Reference, 9th Edition

This is Herb's most popular book on Java, fully updated and expanded to cover Java SE 8 (JDK 8).    Whether you're an experienced pro or just starting out, this one-stop guide will help you master this important language.  Inside you'll find comprehensive coverage of the Java language, its keywords, syntax, and fundamental programming principles.  Of course, descriptions of Java's newest features, such as lambda expressions, default interface methods, and the stream API are included. This lasting resource also describes key elements of the Java API library, such as the Collections Framework, concurrency, applets, servlets, Beans, event handling,  AWT,  Swing, and more. Coverage of JavaFX, Java's newest GUI framework, is also included. *** TO REVIEW BOOK ***  (click below) *** TO REVIEW SOURCE CODE PROBLEM  SOLUTIONS, VISIT   THIS   LINK ***
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more

Java: A Beginner's Guide, 6th Edition

This is Herb's step-by-step introduction to Java, updated for Java SE 8 (JDK 8). If you are just learning Java, then this is the book for you.  It starts at the beginning, explaining the history of Java, why it's important to the Web, and how it relates to the world of programming at large.  You then learn how to obtain the Java Development Kit (JDK) and write your first Java program. Next, it's on to the Java fundamentals, including data types, operators, control statements, classes, objects, and methods.  You'll then progress to more advanced topics, such as inheritance, exception handling, the I/O system, multithreading,  applets, and lambda expressions. Also included is coverage of some of Java's most powerful features, such as generics, autoboxing, enumerations, and static import.  An introduction to JavaFX, Java's newest GUI framework, is also included. *** TO REVIEW BOOK *** (click below) *** TO REVIEW SOURCE CODE PROBLEM  SOLUTIO
Read more

The C Programming Language, 2nd Edition*

This book is meant to help the reader learn how to program in C. It is the definitive reference guide, now in a second edition. Although the first edition was written in 1978, it continues to be a worldwide best-seller. This second edition brings the classic original up to date to include the ANSI standard. For evolution of the planet earth and our modern understanding of biology, there was Darwin's Origin of the Species. For mathematics, there was Newton's Philosophiæ Naturalis Principia Mathematica. Well, for the internet, for Facebook, for LinkedIn, Twitter, Instgram, Snapchat, WhatsApp, Pornhub and even the odious website for Justin Bieber would never have existed without Kernigan and Ritchie (more affectionately known as K&R)'s classic, The C Programming Language. What language was TCP/IP written in? C. What language inspired both C++ and Java (and the abominable C#)? C. What language are most libraries on most operating systems written in if not assembler? C.
Read more