FilesExpand file tree

 main

/

MergeSort.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

42 lines (36 loc) · 1.19 KB

 main

/

MergeSort.java

Top

File metadata and controls

• Code
• Blame

42 lines (36 loc) · 1.19 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

import java.util.Arrays;

public class MergeSort {

private static void merge(int[] nums, int low, int mid, int high, int[] temp) {

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

while (k <= high) {

if (i > mid) {

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

} else if (j > high) {

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

} else if (nums[i] <= nums[j]) {

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

} else {

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

}

}

System.arraycopy(tmp, low, nums, low, high - low + 1);

}

private static void mergeSort(int[] nums, int low, int high, int[] temp) {

if (low >= high) {

return;

}

int mid = (low + high) >>> 1;

mergeSort(nums, low, mid, temp);

mergeSort(nums, mid + 1, high, temp);

merge(nums, low, mid, high, temp);

}

private static void mergeSort(int[] nums) {

int[] temp = new int[nums.length];

mergeSort(nums, 0, nums.length - 1, temp);

}

public static void main(String[] args) {

int[] nums = {1, 2, 7, 4, 5, 3};

mergeSort(nums);

System.out.println(Arrays.toString(nums));

}

}