FilesExpand file tree

 main

/

MergeSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (47 loc) · 820 Bytes

 main

/

MergeSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (47 loc) · 820 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

public class MergeSort {

static void mergesort(int l,int h,int[] arr) {

int m=(l)+(h-l)/2;

mergesort(l,m,arr);

mergesort(m+1,h,arr);

merge(l,m,h,arr);

}

static void merge(int l,int m,int h,int[] arr) {

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

int[] b=new int[arr.length];

while((k<=m) && (j<=h)) {

if(arr[k]<=arr[j]) {

b[i]=arr[k];

k=k+1;

}else {

b[i]=arr[j];

j=j+1;

}

i=i+1;

}

i=l;

if(k>m) {

for(int z=j;z<h;z++) {

b[i]=arr[z];

i=i+1;

}

}else {

for(int x=l;x<=m;x++) {

b[i]=arr[x];i=i+1;

}

}

for(int s=l;s<h;s++) {

arr[s]=b[s];

}

}

public static void main(String[] args) {

try {

int arr[]= {2,3,42,1,3,4,2};

mergesort(0, arr.length-1, arr);

for(int i:arr) {

System.out.print(i+" ");

}

}catch(Exception e) {

e.printStackTrace();

}

}

}