1. Declare an array to hold eight integers. Use a for loop to add eight random integers, all in the range from 50 to 100, inclusive, to this array. Duplicates are okay. Next, pass the array to a method that sorts the array and returns another array containing only the largest and smallest elements in the original array. Print these two values in main. Then use a foreach loop to display all elements of the sorted array on one line separated by a single space. This latter loop should also count the odd and even numbers in the array and determine the sum of all elements in the array. SAMPLE OUTPUT The lowest element is 59 The highest element is 96 Here is the array 59 64 76 77 80 88 91 96 Evens: 5, odds: 3 Total: 631

1. Declare an array to hold eight integers. Use a for loop to add eight random integers, all in the range from 50 to 100, inclusive, to this array. Duplicates are okay. Next, pass the array to a method that sorts the array and returns another array containing only the largest and smallest elements in the original array. Print these two values in main. Then use a foreach loop to display all elements of the sorted array on one line separated by a single space. This latter loop should also count the odd and even numbers in the array and determine the sum of all elements in the array. SAMPLE OUTPUT The lowest element is 59 The highest element is 96 Here is the array 59 64 76 77 80 88 91 96 Evens: 5, odds: 3 Total: 631

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

My issue: I don't know where add the statement to print the numbers[i] array. I don't know what loop to use to show how each element was sorted invididually until it reaches the correct descending order as shown in the images I don't know how to line up number of lines as shown in the images. Code: import java.util.Scanner; public class DescendingOrder {// TODO: Write a void method selectionSortDescendTrace() that takes // an integer array and the number of elements in the array as arguments, // and sorts the array into descending order.public static void selectionSortDescendTrace(int [] numbers, int numElements) {//my code starts hereint i;int j;int elementIndex;int temp; for (i=0; i < numElements-1; ++i) {elementIndex=i;for (j=i+1; j < numElements; ++j) {if (numbers[j] > numbers[elementIndex]) {elementIndex=j;}}temp=numbers[i];numbers[i]=numbers[elementIndex];numbers[elementIndex]=temp;}for(int ti=0;ti<10;ti++){System.out.print(numbers[ti]+" ");}}//my code ends…
Task 02: Review the concept of arithmetic progressions from chapter-2. Write a method that takes an array of n integers as input. The method checks whether an arithmetic progression can be formed using all the given elements. If possible print "Yes", else print "No". hint: The array of integers {18, 15, 6, 9, 12} can form arithmetic progression if arranged as 6,9,12,15,18 so the method returns "Yes" in this case, but the array (12, 40, 11, 20} cannot form an arithmetic progression. The answer returned in this case will be "No".
Write a loop that sets newScores to oldScores shifted once left, with element 0 copied to the end. Ex: If oldScores = {10, 20, 30, 40}, then newScores = {20, 30, 40, 10}.Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int oldScores[4]). Also note: If the submitted code tries to access an invalid array element, such as newScores[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. #include <iostream>using namespace std; int main() { const int SCORES_SIZE = 4; int oldScores[SCORES_SIZE]; int newScores[SCORES_SIZE]; int i; for (i = 0; i < SCORES_SIZE; ++i) { cin >> oldScores[i]; } /* Your solution goes here */ for (i = 0; i < SCORES_SIZE; ++i) { cout << newScores[i] << " "; } cout…
a. Create a 1D array of integers to store 50 integers. b. Store values from 0 to 49 into the array you just created. c. Create a new String Object using no-arg constructor. d. Using for loop append the array elements one by one to the String (one per loop iteration) e. Record and display a run-time it took to append all integers to the String (record run-time of 1.d.)). E.g. "It took nanoseconds to append 50 integers to the String
JAVA Code
Please don't copy and paste
This is the file :
Write an c progra, that takes an array of N integers (N will be specified by the user at run time). It then finds how many numbers in the array are divisible by 3 and how many numbers are divisible by 7. the it copies, from the input array above, the numbers that are divisible by 3 into a new array and those divisible by 7 into a different new array. Once copied, the algorithm should compute the average of each of these two new arrays and print the averages on the screen with suitable message to let the user know which average is being printed Note: an integer number is divisible by 3 (respectively 7) if the remaining of its division by 3 (respectively 7) is 0. You are allowed to use the modulus operator %.
Now your task is to convert array to set. Remember array to set not opposite and print that. In kotlin
Create an array of N items. Implement these using array initializers in the variable declaration. Print each item in the array list. At the end, print the sum of all nos. in the array and their average.
write a method that receives an array and sorts it in an increasing order
Ask the user to enter an integer (n)Declare an array of size n with double data type.Ask the user to enter the values of the array.Create another array with of size n with integer data type.Make a copy of the first array to the second array but in reverse order (e.g., the last element in the first array should be store in the first element in the second array and so on).Output values stored in the two arrays.Find and output how many odd values in both arrays are equal based on the index number, i.e. count matching values of two arrays based on same index value AND the element value of the array.Sample Input/outputEnter n:4Enter array values:1 2 3 4First Array :1 2 3 4 Second Array:4 3 2 1 # of Equal values = 0Enter n:5Enter array values:1 2 3 4 5First Array :1 2 3 4 5 Second Array:5 4 3 2 1 # of Equal values = 1