Data-Structure-Algorithms/Algorithms/merge-sort.c at d773784c4bb19d3b6104ade93d1e20b5dbeac99b · Grv-Singh/Data-Structure-Algorithms · GitHub

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
int X[10]={53,17,20,33,28,14,29,15,77,24};
int temp[];

void Merge(int A[], int temp[], int left, int mid, int right){
    int i, left_end, size, temp_pos;
    left_end = mid-1;
    temp_pos = left;
    size = right - left +1;
    while((left<=left_end)&&(mid<=right)){
        if(A[left]<=A[mid]){
            temp[temp_pos]=A[left];
            temp_pos=temp_pos+1;
            left=left+1;
        }
        else{
            temp[temp_pos]=A[mid];
            temp_pos=temp_pos+1;
            mid=mid+1;
        }
    }

    while(left<=left_end){
        temp[temp_pos]=A[left];
        left=left+1;
        temp_pos=temp_pos+1;
    }

    while(mid<=right){
        temp[temp_pos]=A[mid];
        mid=mid+1;
        temp_pos=temp_pos+1;
    }

    for(i=0;i<=size;i++){
        A[right]=temp[right];
        right=right-1;
    }
}


void Mergesort(int A[], int temp[], int left, int right){
    int mid;
    if(right>left){
        mid = (right+left)/2;
        Mergesort(A,temp,left,mid);
        Mergesort(A,temp,mid+1,right);
        Merge(A,temp,mid+1,right);
    }
}

Mergesort(X,temp,0,9);
printf("%d",X);