Question

use the same code. but the code needs some modifications. so use this same code and modify it and provide a output

Java Program to Implement Merge Sort import java.util.Scanner Class MergeSort public class MergeSort Merge Sort function / public static yoid sortfintfl a, int low, int high) int N-high-low; if (N1) return; int mid- low +N/2; Il recursively sort sort(a, low, mid); sort(a, mid, high); I/ merge two sorted subarrays int] temp new int[N]; int i- low, j-mid; for (int k 0; k < N; k++) mid) if (i temp[k]- alj++]; else if (j-high) temp[k] = a[i++]; else if (aljka[il) temp[k] = alj++]; else temp(k]- a[i++]; } for (int k 0; k<N; k++)

Answer 1

import java.io.*;
import java.util.Scanner;
/* Class MergeSort */
public class MergeSort {
/* Merge Sort function */
public static void sort(int []a,int low, int high){
int N=high-low;
if(N<=1)
return;
int mid = low+N/2;
//recursively sort
sort(a,low,mid);
sort(a,mid,high);
//merge two sorted subarrays
int []temp = new int[N];
int i=low,j=mid;
for(int k=0;k<N;k++){
if(i==mid)
temp[k]=a[j++];
else if(j==high)
temp[k]=a[i++];
else if(a[j]<a[i])
temp[k]=a[j++];
else
temp[k]=a[i++];
}
for(int k=0;k<N;k++){
a[low+k]=temp[k];
}
}
   public static void main (String[] args) {
       Scanner scan = new Scanner(System.in);
       System.out.println("Merge Sort Test\n");
       int n,i;
       /* Accept number of elements */
       System.out.println("Enter number of integer elements");
       n= scan.nextInt();
       /* Create array of n elements */
       int arr[] = new int[n];
       /* Accept elements */
       System.out.println("\nEnter "+n+" integer elements");
       for(i=0;i<n;i++)
       arr[i]=scan.nextInt();
       /* Call method sort */
       sort(arr,0,n);
       /*Print sorted array */
       System.out.println("Sorted Array:");
       for(i=0;i<n;i++)
       System.out.printf(arr[i]+" ");
       System.out.println();
   }
}

Output:

Run 4 Copy 133 35 31 1 Run+URL (Generates URL as well) Time(sec) : 0.12 Memory(MB) : 55.4102 Output: Copy Merge Sort Test Enter number of integer elements Enter 4 integer elements Sorted Array: 1 31 35 133