FilesExpand file tree

 master

/

MergeSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

34 lines (27 loc) · 599 Bytes

 master

/

MergeSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

34 lines (27 loc) · 599 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

public class MergeSortedArray {

public void merge(int A[], int m, int B[], int n) {

//from A,B's end ,compare, larger one place at A's end

while(m>=1 && n>=1){

if(A[m-1]<=B[n-1]){

A[m+n-1] = B[n-1];

//length--;

n--;

}else{

A[m+n-1] = A[m-1];

//length--;

m--;

}

}

if (m<1){

while(n>=1){

A[n-1] = B[n-1];

n--;

}

}else{

//do nothing, since A already sorted.

}

}

public static void main(String[] args) {

// TODO Auto-generated method stub

}

}