Java

Member 4277480 wrote:

In line 42 modify it to mergesort(data, 0, data.length);

Member 4277480 wrote:

By the way the line I told you to change was from the link I told you about not yours

import java.io.*;
   import java.util.*;

    class MergeSortArray
   {
       public static void main(String[] args)
      {
      
         int choice = 0;
      
         int[]values;
         int counter = 0;
         int backCounter = 10;
      
         values = new int[10];
      
         while(counter != 10)
         {
            Scanner scanner = new Scanner (System.in);
            System.out.println("Enter " + backCounter + " more integers:");
            choice = scanner.nextInt();
            values[counter] = choice;
            counter++;
            backCounter--;
         }
      		
         System.out.println(counter);
       
      	
         mergeSort (values, 1, values.length-1);
        // merge (values, first, mid, last);
      
      	
      
         int i=0;
         while(i<10)
         {
            System.out.println(values[i]);
            i++;
         }
      	
      }
          
       public static void mergeSort (int[] data, int min, int max)
      {
         if (min < max)
         {
            int mid = (min + max) / 2;
            mergeSort(data, min, mid);
            mergeSort(data, mid+1, max);
            merge (data, min, mid, max);
         
         }
      }
   
   //---------------------------------------------------------------------------------------
   //  Sorts the specified array of objects using the merge sort algorithm.
   //---------------------------------------------------------------------------------------
   
       public static void merge (int[] data, int first, int mid, int last)
      {
         int[] temp = new int[data.length];
      
         int first1 = first, last1 = mid; //endpoints of first subarray
         int first2 = mid + 1, last2 = last; //endpoints of second subarray
         int index = first1; // next index open in temp array
      
      // Copy smaller item from each subarry into temp until one of the subarrays is exhausted
      
         while (first1 <= last1 && first2 <= last2)
         {
//******* NEXT ISSUE here! MergeSortArray.java:72: int cannot be dereferenced
            if (data[first1].compareTo(data[first2]) < 0)
            {
               temp[index] = data[first1];
               first1++;
            }
            else
            {
               temp[index] = data[first2];
               first2++;
            }
            index++;
         }
      //  Copy remaining elements from first subarray, if any
         while (first1 <= last1)
         {
            temp[index] = data[first1];
            first1++;
            index++;
         }
      
      //  Copy remaining elements from second subarray, if any
         while (first2 <= last2)
         {
            temp[index] = data[first2];
            first2++;
            index++;
         }
      
      // Copy merged data into original array
         for (index = first; index <= last; index++)
            data[index] = temp[index];
      }
   }   

if (data[first1].compareTo(data[first2]) < 0)

;if (data[first1]== data[first2] < 0)

import java.io.*;
import java.util.*;

class MergeSortArray 
{
	public static void main(String[] args) 
	{
		int choice = 0;
		Comparable[] values;
		int counter = 0;
		int backCounter = 10;
		values = new Comparable[10];

		while (counter != 10) 
		{
			Scanner scanner = new Scanner(System.in);
			System.out.println("Enter " + backCounter + " more integers:");
			choice = scanner.nextInt();
			values[counter] = choice;
			counter++;
			backCounter--;
		}
		mergeSort(values, 0, values.length - 1);
		
		System.out.println();
		
		int i = 0;
		while (i < 10) 
		{
			System.out.print(values[i] + " ");
			i++;
		}
	}
	
	public static void mergeSort(Comparable[] data, int min, int max) 
	{
		if (min < max) 
		{
			int mid = (min + max) / 2;
			mergeSort(data, min, mid);
			mergeSort(data, mid + 1, max);
			merge(data, min, mid, max);
		}
	}

	public static void merge(Comparable[] data, int first, int mid, int last) 
	{
		Comparable[] temp = new Comparable[data.length];

		int first1 = first, last1 = mid;
		int first2 = mid + 1, last2 = last; 
		int index = first1; 

		while (first1 <= last1 && first2 <= last2)
		{
			if (data[first1].compareTo(data[first2]) < 0) 
			{
				temp[index] = data[first1];
				first1++;
			} 
			else 
			{
				temp[index] = data[first2];
				first2++;
			}
			index++;
		}
		
		while (first1 <= last1) 
		{
			temp[index] = data[first1];
			first1++;
			index++;
		}
		
		while (first2 <= last2) 
		{
			temp[index] = data[first2];
			first2++;
			index++;
		}

		for (index = first; index <= last; index++)
			data[index] = temp[index];
	}
}

import java.io.*;

public class FileWrite 
{
  public static void main(String[] args) throws Exception 
  {
    PrintWriter out = new PrintWriter(new File("test.text"));
    out.print("The String Value");// Any type you want 
    out.close();
  }
}

<session-descriptor>
  <cookie-domain>mydomain.com</cookie-domain>
</session-descriptor>

if (carChoice==("Ford") carChoice==("Chevy") carChoice.==("Toyota"))

if (insurable);