FilesExpand file tree

master

/

MergeSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (31 loc) · 882 Bytes

master

/

MergeSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (31 loc) · 882 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

package dev.wenbo.algorithm;

public class MergeSort {

public static void mergeSort(int[] array){

sort(array, 0, array.length-1);

}

private static void sort(int[] array, int lo, int hi){

if(lo>=hi)

return;

int mid=(lo+hi)/2;

sort(array, lo, mid);

sort(array, mid+1, hi);

merge(array, lo, mid, hi);

}

private static void merge(int[] array, int lo, int mid, int hi){

int[] aux=new int[array.length];

int i=lo, j=mid+1;

for(int k=lo;k<=hi;k++){

aux[k]=array[k];

}

for(int k=lo;k<=hi;k++){

if(i>mid)

array[k]=aux[j++];

else if(j>hi)

array[k]=aux[i++];

else if(aux[j]<aux[i])

array[k]=aux[j++];

else

array[k]=aux[i++];

}

}

}