GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Algorithm/java/coding/mergeSortedArray.java at master · lelea2/Algorithm Expand file tree/ Copy pathmergeSortedArray.javaMore file actions 16 lines (14 loc) · 616 Bytes / Copy pathmergeSortedArray.javaFile metadata and controls16 lines (14 loc) · 616 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 //The key to solve this problem is moving element of A and B backwards. If B has some elements left after A is done, also need to handle that case. //The takeaway message from this problem is that the loop condition. This kind of condition is also used for merging two sorted linked list. public void merge(int A[], int m, int B[], int n) { int i = m - 1; //m is length of array A int j = n - 1; //n is length of array B int k = m + n - 1; while (k >= 0) { if (j < 0 || (i >= 0 && A[i] > B[j])) { A[k--] = A[i--]; } else { A[k--] = B[j--]; } } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |