FilesExpand file tree

 main

/

mergeSort_recursive.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (46 loc) · 771 Bytes

 main

/

mergeSort_recursive.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (46 loc) · 771 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include<iostream>

using namespace std;

void merge(int A[],int l,int mid,int h)

{

int i=l,j=mid+1,k=l;

int B[100];

while(i<=mid && j<=h)

{

if(A[i]<A[j])

B[k++]=A[i++];

else

B[k++]=A[j++];

}

for(;i<=mid;i++)

B[k++]=A[i];

for(;j<=h;j++)

B[k++]=A[j];

for(i=l;i<=h;i++)

A[i]=B[i];

}

void mergeSort(int A[], int l, int h){

int mid;

if(l<h){

mid=(l+h)/2;

mergeSort(A, l, mid);

mergeSort(A, mid+1, h);

merge(A, l, mid, h);

}

}

int main()

{

int n;

cout << "Enter the size of the Array: ";

cin >> n;

int arr[n];

cout << "Enter the elements of the Array: ";

for(int i = 0; i < n; i++){

cin >> arr[i];

}

mergeSort(arr, 0, n-1);

cout<<"\nSorted Array : \n";

for(int i=0;i<n;i++){

cout<<arr[i]<<" ";

}

return 0;

}