Scribd
Upload
11 views2 pages

Algo Assiginment

Uploaded by

itztozx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
11 views2 pages

Algo Assiginment

Uploaded by

itztozx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include <stdio.

h>
#include <stdlib.h>

void merge(int A[], int n, int B[], int m, int C[], int p) {
int i = 0, j = 0, k = 0;
while (i < m && j < p) {
if (B[i] < C[j]) {
A[k] = B[i];
i++;
} else {
A[k] = C[j];
j++;
}
k++;
}
while (i < m) {
A[k] = B[i];
i++;
k++;
}
while (j < p) {
A[k] = C[j];
j++;
k++;
}
}

void mergesort(int A[], int n) {


if (n > 1) {
int m = n / 2;
int p = n - m;
int *B = (int *)malloc(m * sizeof(int));
int *C = (int *)malloc(p * sizeof(int));
for (int i = 0; i < m; i++)
B[i] = A[i];
for (int i = 0; i < p; i++)
C[i] = A[m + i];
mergesort(B, m);
mergesort(C, p);
merge(A, n, B, m, C, p);

free(B);
free(C);
}
}

int main() {
int n;
printf("Enter the number of elements: ");
scanf("%d", &n);

int *A = (int *)malloc(n * sizeof(int));

printf("Enter %d elements:\n", n);


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

mergesort(A, n);
printf("Sorted array: ");
for (int i = 0; i < n; i++)
printf("%d ", A[i]);
printf("\n");

free(A);

return 0;
}

You might also like