FilesExpand file tree

 master

/

MergeSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (51 loc) · 1.46 KB

 master

/

MergeSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (51 loc) · 1.46 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

package com.yangchd.sort;

/**

* @author yangchd 2018/5/29

*

* 归并排序

* 1.选择相邻两个数组成一个有序序列。

* 2.选择相邻的两个有序序列组成一个有序序列。

* 3.重复第二步，直到全部组成一个有序序列。

*/

public class MergeSort {

public void mergeSort(int[] a) {

mergeSort(a, 0, a.length - 1);

}

private void mergeSort(int[] a, int low, int high) {

int mid = (low + high) / 2;

if (low < high) {

// 左边

mergeSort(a, low, mid);

// 右边

mergeSort(a, mid + 1, high);

// 左右归并

merge(a, low, mid, high);

}

}

private void merge(int[] a, int low, int mid, int high) {

int[] temp = new int[high - low + 1];

// 左指针

int i = low;

// 右指针

int j = mid + 1;

int k = 0;

// 把较小的数先移到新数组中

while (i <= mid && j <= high) {

if (a[i] < a[j]) {

temp[k++] = a[i++];

} else {

temp[k++] = a[j++];

}

}

// 把左边剩余的数移入数组

while (i <= mid) {

temp[k++] = a[i++];

}

// 把右边边剩余的数移入数组

while (j <= high) {

temp[k++] = a[j++];

}

// 把新数组中的数覆盖旧数组

System.arraycopy(temp, 0, a, low, temp.length);

}

}