http://snippets.dzone.com/posts Mon, 21 Jul 2008 09:12:46 GMT DZone Snippets: mergesort code http://snippets.dzone.com/posts/show/4463 // by kyle 2007.8.24 using java <br /> <br /><code> <br />package com.chapter2; <br /> <br />public class MergeSortV2 { <br /> <br /> /** <br /> * @param args <br /> */ <br /> static void Merge(int A[],int p, int q, int r) <br /> { <br /> int n1 = q-p+1; <br /> int n2 = r-q; <br /> int L[] = new int[n1+2]; <br /> int R[] = new int[n2+2]; <br /> for(int i = 1; i <= n1; i++) <br /> { <br /> L[i] = A[p+i-1]; <br /> } <br /> for(int j = 1; j <= n2; j++) <br /> { <br /> R[j] = A[q+j]; <br /> } <br /> L[n1+1] = Integer.MAX_VALUE; <br /> R[n2+1] = Integer.MAX_VALUE; <br /> int i = 1; <br /> int j = 1; <br /> for(int k = p; k <= r; k++) <br /> { <br /> if(L[i] < R[j]) <br /> { <br /> A[k] = L[i]; <br /> i++; <br /> } <br /> else <br /> { <br /> A[k] = R[j]; <br /> j++; <br /> } <br /> } <br /> } <br /> static void MergeSort(int A[],int p, int r) <br /> { <br /> if(p<r) <br /> { <br /> int q = (p+r)/2; <br /> MergeSort(A, p, q); <br /> MergeSort(A, q+1, r); <br /> Merge(A, p, q, r); <br /> <br /> } <br /> } <br /> public static void main(String[] args) { <br /> // TODO Auto-generated method stub <br /> <br /> int arr[] = {6,23,33,1,5,77}; <br /> MergeSort(arr,1,5); <br /> for(int i = 0; i < 6; i++) <br /> { <br /> System.out.println(arr[i]); <br /> } <br /> } <br /> <br />} <br /> <br /></code> Fri, 24 Aug 2007 13:45:58 GMT http://snippets.dzone.com/posts/show/4463 catsky (kyle zheng)