-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmergesort.cpp
More file actions
67 lines (56 loc) · 1000 Bytes
/
mergesort.cpp
File metadata and controls
67 lines (56 loc) · 1000 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include<stdlib.h>
#include<stdio.h>
using namespace std;
void merge(int arr[], int l,int m,int r){
int i,j,k;
int n1 = m-l+1;
int n2 = r-m;
int L[n1],R[n2];
for(i=0;i<n1;i++)
L[i] = arr[l+i];
for(j=0;j<n2;j++)
R[j] = arr[m+1+j];
i=0;
j=0;
k=l;
while(i<n1 && j<n2){
if(L[i] <= R[j]){
arr[k] = L[i];
i++;
}else{
arr[k] = R[j];
j++;
}
k++;
}
while(j<n2){
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[],int l,int r){
if(l<r){
int m= l+(r-1)/2;
mergeSort(arr,l,m);
mergeSort(arr,m+1,r);
merge(arr,l,m,r);
}
}
void printArray(int A[],int size){
int i;
for(i=0;i<size;i++){
printf("%d ",A[i]);
}
printf("\n");
}
int main(){
int arr[] = {12,11,13,5,6,7};
int arr_size = (int)sizeof(arr)/sizeof(arr[0]);
printf("Given array is \n");
printArray(arr,arr_size);
mergeSort(arr,0,arr_size-1);
printf("\nSorted array is \n");
printf(arr,arr_size);
return 0;
}