Question

Write an application in Java which includes an algorithm that takes an array of any size, selects the high and low integer from the array of integers with each pass and builds a new array of integers by inserting the high and low selection with each pass. Your output should show the original array of integers and the output of each pass on a new line.

**Note: You can assume all integers are positive, but your
code must work for an even and odd number of
integers and an array of size from 5 to 30.**

**Example Output:**

Input Array: [ 42 , 24, 7, 13, 36, 52]

Pass 1: [7, 52]

Pass 2: [7, 13, 42, 52]

Pass 3: [7, 13, 24, 36, 42, 52]

Answer #1

**Java Code :**

import java.util.*;

import java.io.*;

public class HighLowPass{

public static Scanner s = new Scanner(System.in);

static int tempArray2[] = {};

public static void main(String []args){

System.out.println("Enter the array size");

int size = s.nextInt();

int[] numbers = new int[size];

System.out.println("Enter the array elements");

for(int i=0;i<numbers.length;i++){

numbers[i] = s.nextInt();

}

arrayPass(numbers);

}

public static void arrayPass(int numbers[]){

int[] tempArray = numbers;

tempArray = ascendingArray(tempArray);

for(int i=0;i<tempArray.length/2;i++){

lowHighArrayPass(tempArray[i],tempArray[tempArray.length-1-i]);

}

if(tempArray.length%2 != 0 ){

lowHighArrayPass(tempArray[tempArray.length/2],-1);

}

}

public static void lowHighArrayPass(int low , int high){

int tempArray[] = {low,high};

tempArray = mergeArrays(tempArray,tempArray2);

tempArray = ascendingArray(tempArray);

tempArray2 = tempArray;

System.out.print("Pass : [");

for(int a : tempArray){

if(a!=-1) System.out.print(a+" ");

}

tempArray2 = tempArray;

System.out.print("]\n");

}

public static int[] ascendingArray(int[] tempArray){

for(int i=0;i<tempArray.length;i++){

for(int j=0;j<tempArray.length;j++){

if(tempArray[i]<tempArray[j]){

int temp = tempArray[i];

tempArray[i] = tempArray[j];

tempArray[j] = temp;

}

}

}

return tempArray;

}

public static int[] mergeArrays(int a[], int b[]){

int temp[] = new int[a.length+b.length];

int i=0;

for(int element : a){

temp[i++] = element;

}

for(int element : b){

temp[i++] = element;

}

return temp;

}

}

1. Given an
n-element array A, Algorithm X executes an
O(n)-time computation for each even
number in A and an O(log n)-time computation for
each odd number in A.
What is the best-case running time of Algorithm X?
What is the worst-case running time of Algorithm X?
2. Given an array,
A, of n integers, give an O(n)-time algorithm that finds
the longest subarray of A such that all the numbers in that
subarray are in sorted order. Your algorithm...

Java : Modify the selection sort algorithm to
sort an array of integers in descending order. describe how the
skills you have gained could be applied in the field.
Please don't use an already answered solution from chegg. I've
unfortunately had that happen at many occasion
.......
........
sec01/SelectionSortDemo.java
import java.util.Arrays;
/**
This program demonstrates the selection sort algorithm by
sorting an array that is filled with random numbers.
*/
public class SelectionSortDemo
{
public static void main(String[] args)
{...

Using C++, Python, or Java, write a program
that:
In this programming exercise you will perform an
empirical analysis of the
QuickSort algorithm to study the actual average case
behavior and compare it to the mathematically predicted behavior.
That is, you will write a program that counts the number of
comparisons performed by QuickSort on an array of a given
size. You will run the program on a large number of arrays of a
certain size and determine the average...

IN JAVA!!
You may be working with a programming language that has arrays,
but not nodes. In this case you will need to save your BST in a two
dimensional array. In this lab you will write a program to create a
BST modelled as a two-dimensional array. The output from your
program will be a two-dimensional array.
THEN: practice creating another array-based BST using integers
of your choice.
Once you have figured out your algorithm you will be able...

Download the ProductUpTo3.java file, and open it in jGrasp (or a
text editor of your choice). This program will read in three
integers with Scanner, put the values in an array of int, and then
print the product of the three values. Example output of the
program is shown below, with user input shown in
bold:
Enter first integer: 3
Enter second integer: 4
Enter third integer: 5
Product: 60
More details about the method you need to write are...

Implement functions for insertion sort, quicksort, heapsort and
merge sort that input an array of integers and sort it
in-place.
Write a program that generates random integer arrays (hint: use
seed appropriately to avoid generating same sequences) of lengths
10, 100, 1000, 10,000, 100,000, 1000,000, and then sorts each using
each of the sorting functions from (a), and measures the time in
nanoseconds. The program will repeat this process 30 times and will
compute the average execution time for each...

Question 2:
Write a C program that read 100 integers from the attached file
(integers.txt) into an array and copy the integers from the array
into a Binary Search Tree (BST). The program prints out the
following:
The number of comparisons made to search for a given integer in the
BST
And
The number of comparisons made to search for the same integer in
the array
Question 3
Run the program developed in Question 2 ten times. The given values...

You are asked to implement a C++ class to model a sorted array
of unsigned integers. The class is to be used in an embedded
application that cannot assume the presence of the STL. The array
has to be dynamically allocated in such a way that allows
programmers using it to specify the required size. Your class
should should: (1) provide the appropriate constructors and
destructor; (2) provide methods for updating, and showing numbers
in/to the array (e.g., to be...

Use Java:
Also: Please include screenshots if possible.
Create a class called AbstractStackTest.
Write an abstract method called makeStack that returns a Stack
of Strings. Use the Stack interface as
the return type, not a specific implementation!
Write a class named NodeStackTest that extends your
AbstractStackTest class. Implement the makeStack method to return a
NodeStack.
Repeat parts 1 and 2 for the Queue interface and the NodeQueue
implementation.
Write a new stack implementation, ArrayStack. It should be
generic and use...

Java question, Please answer
everything. Thank you
Answer the following questions as briefly (but completely) as
possible:
What is a checked exception, and what is an unchecked
exception?
What is NullPointerException?
Which of the following statements (if any) will throw an
exception? If no exception is thrown, what is the output?
1: System.out.println( 1 / 0 );
2: System.out.println( 1.0 / 0 );
Point out the problem in the following code. Does the code
throw any exceptions?
1: long value...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 1 minute ago

asked 59 minutes ago

asked 1 hour ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago

asked 4 hours ago

asked 4 hours ago