Reply to thread

Message

<blockquote data-quote="Anonymous_Abstract" data-source="post: 24659379" data-attributes="member: 568286">&nbsp;&nbsp; Complete Code Of Merge Sortpackage com.benz.test;public class MergeAlgo {&nbsp; &nbsp; public static void main(String[] args)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; MergeAlgo al = new MergeAlgo();&nbsp; &nbsp; &nbsp; &nbsp; al.algo();&nbsp; &nbsp; }public void algo(){&nbsp; &nbsp; int[] arr= {5,4,3,2,1};&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; arr =mergeSort(arr);&nbsp; &nbsp; &nbsp; &nbsp; for(int a : arr)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; System.out.print(a+&quot;\t&quot;);&nbsp; &nbsp; }}public int[] mergeSort(int[] A){&nbsp; &nbsp;&nbsp; int n = A.length;&nbsp; &nbsp;&nbsp; &nbsp; &nbsp;&nbsp; if(n&lt;2)&nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; return A;&nbsp; &nbsp;&nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int mid = (n-1)/2;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int nL,nR;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; nL=mid+1;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; nR=n-(mid+1);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int[] left = new int[nL];&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int[] right = new int[nR];&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; for(int i=0;i&lt;=mid;i++)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; left = A;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; for(int i=mid+1;i&lt;n;i++)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; right[i-(mid+1)]=A;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int[] array = new int[A.length];&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; mergeSort(left);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; mergeSort(right);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; array = merge(left,right);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; return array;&nbsp; &nbsp;&nbsp; }}&nbsp; &nbsp;&nbsp; public int[] merge(int[] L,int[] R){&nbsp; &nbsp; int[] A = new int[L.length+R.length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int nL = L.length;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int nR = R.length;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int i,j,k;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; i=j=k=0;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; while(i&lt;nL &amp;&amp; j&lt;nR)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; if(L&lt;=R)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; A[k]=L;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; i++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; A[k]=R[j];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; j++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; k +=1;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; while(i&lt;nL)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; A[k]=L;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; i++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; k +=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; while(j&lt;nR)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; A[k]=R[j];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; j++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; k +=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp;&nbsp; return A;&nbsp; &nbsp; &nbsp; &nbsp; }}</blockquote>

[QUOTE="Anonymous_Abstract, post: 24659379, member: 568286"] [SIZE="5"] Complete Code Of Merge Sort[/SIZE] [SIZE="4"][COLOR="Blue"]package com.benz.test; public class MergeAlgo { public static void main(String[] args) { MergeAlgo al = new MergeAlgo(); al.algo(); } public void algo() { int[] arr= {5,4,3,2,1}; arr =mergeSort(arr); for(int a : arr) { System.out.print(a+"\t"); } } public int[] mergeSort(int[] A) { int n = A.length; if(n<2) { return A; }else { int mid = (n-1)/2; int nL,nR; nL=mid+1; nR=n-(mid+1); int[] left = new int[nL]; int[] right = new int[nR]; for(int i=0;i<=mid;i++) { left[i] = A[i]; } for(int i=mid+1;i<n;i++) { right[i-(mid+1)]=A[i]; } int[] array = new int[A.length]; mergeSort(left); mergeSort(right); array = merge(left,right); return array; } } public int[] merge(int[] L,int[] R) { int[] A = new int[L.length+R.length]; int nL = L.length; int nR = R.length; int i,j,k; i=j=k=0; while(i<nL && j<nR) { if(L[i]<=R[i]) { A[k]=L[i]; i++; }else { A[k]=R[j]; j++; } k +=1; } while(i<nL) { A[k]=L[i]; i++; k +=1; } while(j<nR) { A[k]=R[j]; j++; k +=1; } return A; } } [/i][/i][/i][/i][/i][/i][/i][/COLOR][i][i][i][i][i][i][i][/i][/i][/i][/i][/i][/i][/i][/SIZE][i][i][i][i][i][i][i][/i][/i][/i][/i][/i][/i][/i] [/QUOTE]

Verification

Hata thunen beduwama keeyada? (60 bedeema thuna)

Search

Latest ads

Reply to thread