![Please help with this JAVA Assignment and show output if you can please
Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done.
1. Implement linear-sort, merge-sort and quick-sort (write the code for them).
Solution
Linear or Insertion Sort
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class LinearSort
{
public static void sort( int values[] )
{
int N = values.length;
int i, j, temp;
for (i = 1; i< N; i++)
{
j = i;
temp = values[i];
while (j > 0 && temp < values[j-1])
{
values[j] = values[j-1];
j = j-1;
}
values[j] = temp;
}
}
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
int n, i;
System.out.println("Enter number of elements");
n = scan.nextInt();](https://image.slidesharecdn.com/pleasehelpwiththisjavaassignmentandshowoutputifyoucanple-230704015257-b7dd219b/85/Please-help-with-this-JAVA-Assignment-and-show-output-if-you-can-ple-pdf-1-320.jpg)
![int values[] = new int[n];
System.out.println(" Enter elements");
for (i = 0; i < n; i++)
values[i] = scan.nextInt();
sort(values);
System.out.println(" Sorted Elements");
for (i = 0; i < n; i++)
System.out.print(values[i]+" ");
System.out.println();
}
}
Output:
Enter number of elements
6
Enter elements
34 56 12 8 9 23
Sorted Elements
8 9 12 23 34 56
Merge Sort
import java.util.Scanner;
public class Mergesort
{
public static void mergesort(int[] a, int low, int high)
{
int N = high - low;
if (N <= 1)
return;
int mid = low + N/2;
mergesort(a, low, mid);
mergesort(a, mid, high);
int[] temp = new int[N];
int i = low, j = mid;
for (int k = 0; k < N; k++)
{
if (i == mid)
temp[k] = a[j++];](https://image.slidesharecdn.com/pleasehelpwiththisjavaassignmentandshowoutputifyoucanple-230704015257-b7dd219b/85/Please-help-with-this-JAVA-Assignment-and-show-output-if-you-can-ple-pdf-2-320.jpg)
![else if (j == high)
temp[k] = a[i++];
else if (a[j] pivot)
j--;
if (i <= j)
{
temp = values[i];
values[i] = values[j];
values[j] = temp;
i++;
j--;
}
}
if (low < j)
quickquicksort(values, low, j);
if (i < high)
quickquicksort(values, i, high);
}
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
int n, i;
System.out.println("Enter number of elements");
n = scan.nextInt();
int values[] = new int[ n ];
System.out.println(" Enter elements");
for (i = 0; i < n; i++)
values[i] = scan.nextInt();
quicksort(values);
System.out.println(" qSorted Elements ");
for (i = 0; i < n; i++)
System.out.print(values[i]+" ");
System.out.println();
}
}
Output:](https://image.slidesharecdn.com/pleasehelpwiththisjavaassignmentandshowoutputifyoucanple-230704015257-b7dd219b/85/Please-help-with-this-JAVA-Assignment-and-show-output-if-you-can-ple-pdf-3-320.jpg)
Please help with this JAVA Assignment and show output if you can ple.pdf
- 1. Please help with this JAVA Assignment and show output if you can please Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done. 1. Implement linear-sort, merge-sort and quick-sort (write the code for them). Solution Linear or Insertion Sort import java.util.*; import java.lang.*; import java.io.*; import java.util.Scanner; class LinearSort { public static void sort( int values[] ) { int N = values.length; int i, j, temp; for (i = 1; i< N; i++) { j = i; temp = values[i]; while (j > 0 && temp < values[j-1]) { values[j] = values[j-1]; j = j-1; } values[j] = temp; } } public static void main(String[] args) { Scanner scan = new Scanner( System.in ); int n, i; System.out.println("Enter number of elements"); n = scan.nextInt();
- 2. int values[] = new int[n]; System.out.println(" Enter elements"); for (i = 0; i < n; i++) values[i] = scan.nextInt(); sort(values); System.out.println(" Sorted Elements"); for (i = 0; i < n; i++) System.out.print(values[i]+" "); System.out.println(); } } Output: Enter number of elements 6 Enter elements 34 56 12 8 9 23 Sorted Elements 8 9 12 23 34 56 Merge Sort import java.util.Scanner; public class Mergesort { public static void mergesort(int[] a, int low, int high) { int N = high - low; if (N <= 1) return; int mid = low + N/2; mergesort(a, low, mid); mergesort(a, mid, high); int[] temp = new int[N]; int i = low, j = mid; for (int k = 0; k < N; k++) { if (i == mid) temp[k] = a[j++];
- 3. else if (j == high) temp[k] = a[i++]; else if (a[j] pivot) j--; if (i <= j) { temp = values[i]; values[i] = values[j]; values[j] = temp; i++; j--; } } if (low < j) quickquicksort(values, low, j); if (i < high) quickquicksort(values, i, high); } public static void main(String[] args) { Scanner scan = new Scanner( System.in ); int n, i; System.out.println("Enter number of elements"); n = scan.nextInt(); int values[] = new int[ n ]; System.out.println(" Enter elements"); for (i = 0; i < n; i++) values[i] = scan.nextInt(); quicksort(values); System.out.println(" qSorted Elements "); for (i = 0; i < n; i++) System.out.print(values[i]+" "); System.out.println(); } } Output:
- 4. Enter number of elements 8 Enter elements 89 23 90 56 13 71 46 13 Sorted Elements 13 13 23 46 56 71 89 90