FilesExpand file tree

 deepak_hack

/

MergeSort.cpp

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

72 lines (71 loc) · 1.43 KB

 deepak_hack

/

MergeSort.cpp

Top

File metadata and controls

• Code
• Blame

72 lines (71 loc) · 1.43 KB

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

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

#include <iostream>

using namespace std;

void Merge(int* A, int, int, int);

void Merge_Sort(int* A, int p, int r);

int main()

{

int len, n, i;

cout << "Array size: ";

cin >> len;

int a[len];

for (i = 0; i < len; i++) {

cout << "Enter element " << i + 1 << ": ";

cin >> a[i];

}

cout << "Initial array: ";

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

cout << a[i] << " ";

}

Merge_Sort(a, 0, len - 1);

cout << "\nSorted array: ";

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

cout << a[i] << " ";

}

cout << "\n";

return 0;

}

void Merge(int* arr, int p, int q, int r)

{

int n1 = q - p + 1;

int n2 = r - q;

int L[n1 + 1];

int R[n2 + 1];

for (int i = 0; i < n1; i++)

L[i] = arr[p + i];

for (int j = 0; j < n2; j++)

R[j] = arr[q + 1 + j];

int i = 0;

int j = 0;

int n = 0;

while (i != n1 && j != n2) {

if (L[i] > R[j]) {

arr[p + n] = R[j];

j++;

}

else {

arr[p + n] = L[i];

i++;

}

n++;

}

while (j != n2) {

arr[p + n] = R[j];

j++;

n++;

}

while (i != n1) {

arr[p + n] = L[i];

i++;

n++;

}

}

void Merge_Sort(int* arr, int p, int r)

{

if (r > p) {

int q;

q = (p + r) / 2;

Merge_Sort(arr, p, q);

Merge_Sort(arr, q + 1, r);

Merge(arr, p, q, r);

}

}