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 — java-coding-problems/src/MergeSort.java at main · jfullstackdev/java-coding-problems Expand file tree/ Copy pathMergeSort.javaMore file actions 77 lines (53 loc) · 1.11 KB / Copy pathMergeSort.javaFile metadata and controls77 lines (53 loc) · 1.11 KB 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 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 public class MergeSort { public static int[] mergeTwoSortedArrays(int[] one, int[] two) { int[] sorted = new int[one.length + two.length]; int i = 0; int j = 0; int k = 0; while (i < one.length && j < two.length) { if (one[i] < two[j]) { sorted[k] = one[i]; k++; i++; } else { sorted[k] = two[j]; k++; j++; } } if (i == one.length) { while (j < two.length) { sorted[k] = two[j]; k++; j++; } } if (j == two.length) { while (i < one.length) { sorted[k] = one[i]; k++; i++; } } return sorted; } public static int[] mergeSort(int[] arr, int lo, int hi) { if (lo == hi) { int[] br = new int[1]; br[0] = arr[lo]; return br; } int mid = (lo + hi) / 2; int[] fh = mergeSort(arr, lo, mid); int[] sh = mergeSort(arr, mid + 1, hi); int[] merged = mergeTwoSortedArrays(fh, sh); return merged; } public static void main(String[] args) { int[] arr = { 70, 50, 30, 10, 20, 40, 60 }; int[] merged = mergeSort(arr, 0, arr.length - 1); for (int val : merged) { System.out.print(val + " "); } } } |
| 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. |