Java public cts Node t next ni next SolutionYou hav.pdf
0 likes4 views
The document describes the implementation of a merge sort algorithm in Java. It includes details on creating two class files within the same package and outlines the merge function and stack operations for sorting an array. Key components involve handling indices and merging sorted sections of the array.
1 of 2
Download to read offline
![Java public cts Node t next ni next
Solution
You have to create two class file in same package.
First Class File :
package mergesortdemo;
import java.util.*;
public class MergesortDemo
{
public static void merge(int [] A, int first_var, int last_var)
{
int [] temp_var = new int[last_var-first_var+1];
if (first_varmid_var)
{
temp_var[i]= A[i2];
i2++;
}
else
if (i2>last_var)
{
temp_var[i]= A[i1];
i1++;
}
else
if (A[i1] stack=new Stack();](https://image.slidesharecdn.com/javapublicctsnodetnextninextsolutionyouhav-230707221435-b59a6df3/85/Java-public-cts-Node-t-next-ni-next-SolutionYou-hav-pdf-1-320.jpg)
Java public cts Node t next ni next SolutionYou hav.pdf
- 1. Java public cts Node t next ni next Solution You have to create two class file in same package. First Class File : package mergesortdemo; import java.util.*; public class MergesortDemo { public static void merge(int [] A, int first_var, int last_var) { int [] temp_var = new int[last_var-first_var+1]; if (first_varmid_var) { temp_var[i]= A[i2]; i2++; } else if (i2>last_var) { temp_var[i]= A[i1]; i1++; } else if (A[i1] stack=new Stack();
- 2. MergesortRecord m = new MergesortRecord(false, 0, A.length-1); stack.push(m); while (!stack.empty()) { System.out.println("Stack size is: " + stack.size()); System.out.print("Top of stack is: "); stack.peek().print(); m=stack.pop(); if (m.getsorted()) { merge(A,m.getfirst(),m.getlast()); } else{ if (m.getfirst()