Skip to content

Create meregesort.cpp Closes#201 #201

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
AltamasBari wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create meregesort.cpp Closes#201 #201

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
57 changes: 57 additions & 0 deletions meregesort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
#include <stdio.h>
#include <conio.h>
#define size 100
void merge(int a[], int, int, int);
void merge_sort(int a[],int, int);
int main() {
int arr[size], i, n;
printf("\n Enter the number of elements in the array : ");
scanf("%d", &n); printf("\n Enter the elements of the array: ");
for(i=0;i<n;i++) {
scanf("%d", &arr[i]);
}
merge_sort(arr, 0, n-1);
printf("\n The sorted array is: \n");
for(i=0;i<n;i++) printf(" %d\t", arr[i]);
getch();
}
void merge(int arr[], int beg, int mid, int end) {
int i=beg, j=mid+1, index=beg, temp[size], k;
while((i<=mid) && (j<=end)) {
if(arr[i] < arr[j]) {
temp[index] = arr[i];
i++;
}
else {
temp[index] = arr[j];
j++;
}
index++;
}
if(i>mid) {
while(j<=end) {
temp[index] = arr[j];
j++;
index++;
}
}
else {
while(i<=mid) {
temp[index] = arr[i];
i++;
index++;
}
}
for(k=beg;k<index;k++)
arr[k] = temp[k];
}
void merge_sort(int arr[], int beg, int end) {
int mid;
if(beg<end) {
mid = (beg+end)/2;
merge_sort(arr, beg, mid);
merge_sort(arr, mid+1, end);
merge(arr, beg, mid, end);
}
}