Which XXX and YYY correctly output the smallest values? Array userVals contains 100 elements that are integers (which may be positive or negative). Choices are in the form XXX / YYY. // Determine smallest (min) value int minVal; XXX for (i = 0; i < 100; ++i) { if (YYY) { minVal = userVals[i]; } } System.out.println("Min: " + minVal); a. minVal = 0; / userVal > minVal b. minVal = 0; / userVal < minVal c. minVal = userVals[0]; / userVals[i] > minVal d. minVal = userVals[0]; / userVals[i] < minVal JAVA

Which XXX and YYY correctly output the smallest values? Array userVals contains 100 elements that are integers (which may be positive or negative). Choices are in the form XXX / YYY. // Determine smallest (min) value int minVal; XXX for (i = 0; i < 100; ++i) { if (YYY) { minVal = userVals[i]; } } System.out.println("Min: " + minVal); a. minVal = 0; / userVal > minVal b. minVal = 0; / userVal < minVal c. minVal = userVals[0]; / userVals[i] > minVal d. minVal = userVals[0]; / userVals[i] < minVal JAVA

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 16RQ

See similar textbooks

Similar questions

Given two integer arrays prevValues and newValues. Which code copies the array prevValues into newValues? The size of both arrays is NUM_ELEMENTS. a. newValues = prevValues; b. newValues[] = prevValues[]; c. newValues[NUM_ELEMENTS] = prevValues[NUM_ELEMENTS]; d. <code>for (i = 0; i < NUM_ELEMENTS; ++i) { newValues[i] = prevValues[i]; }</code> JAVA
Create an application that compares the four advanced sorting algorithms discussed in this chapter. For the tests, create a 1,000-element randomly generated array. What is the algorithm's position? What happens when you expand the array size to 10,000, then 100,000 elements?
Write a for loop to print all elements in courseGrades, following each element with a space (including the last). Print forwards, then backwards. End each loop with a newline. Ex: If courseGrades = {7, 9, 11, 10}, print:7 9 11 10 10 11 9 7 Hint: Use two for loops. Second loop starts with i = NUM_VALS - 1. Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int courseGrades[4]). Also note: If the submitted code tries to access an invalid array element, such as courseGrades[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 NUM_VALS = 4; int courseGrades[NUM_VALS]; int i; for (i = 0; i < NUM_VALS; ++i) { cin >> courseGrades[i]; } /* Your solution goes…
#include <iostream> #include <string> #include <ctime> using namespace std; void displayArray(double * items, int start, int end) { for (int i = start; i <= end; i++) cout << items[i] << " "; cout << endl; } //The legendary "Blaze Sort" algorithm. //Sorts the specified portion of the array between index start and end (inclusive) //Hmmm... how fast is it? /* void blazeSort(double * items, int start, int end) { if (end - start > 0) { int p = filter(items, start, end); blazeSort(items, start, p - 1); blazeSort(items, p + 1, end); } } */ int main() { //////////////////////////////////////////////////// //Part 1: Implement a method called filter. //////////////////////////////////////////////////// //Filter is a function that takes in an array and a range (start and end). // //Call the first item in the range the 'pivot'. // //Filter's job is to simply separate items within the range based on whether they are bigger or smaller than the pivot. //In…
Below you will find code blocks necessary to insert a value into an ordered array given a position (index) to insert. Be careful! Some lines are not needed. first line COMPLETED: bool insertElement(char array[ ], int& numElems, int &capacity, in position, char value) { last line COMPLETE: bool insertElement(char array[ ], int numElems, int capacity, in position, char value) {
(Random sentences and story writer) Write an app that uses random-number generation to create sentences. Use four arrays of strings, called article, noun, verb andprepostion. Create a sentence by selecting a word at random from each array in the following order: article, noun, verb, preposition, article, noun.As each word is picked, concatenate it to the previous words in the sentence. The words should be separated by spaces. When the sentence is output, it should start witha capital letter and end with a period. The program should generate 10 sentences and output them to a text box. The arrays should be filled as follows:The article array should contain the articles "the", "a", "one", "some" and "any";The noun array should contain the nouns "boy", "girl", "dog", "town", "car";The verb array should contain the past tense verbs "drove", "jumped", "ran", "walked" and "skipped";The preposition array should contain the preposotions "to", "from", "over", "under" and "on";
/*Code: Construct BST From Sorted ArraySend FeedbackGiven a sorted integer array A of size n, which contains all unique elements. You need to construct a balanced BST from this input array. Return the root of constructed BST.Note: If array size is even, take first mid as root.Input format:The first line of input contains an integer, which denotes the value of n. The following line contains n space separated integers, that denote the values of array.Output Format:The first and only line of output contains values of BST nodes, printed in pre order traversal.Constraints:Time Limit: 1 secondSample Input 1:71 2 3 4 5 6 7Sample Output 1:4 2 1 3 6 5 7 */public class SortedArrayToBst { /* Binary Tree Node class * * class BinaryTreeNode<T> { T data; BinaryTreeNode<T> left; BinaryTreeNode<T> right; public BinaryTreeNode(T data) { this.data = data; } } */…
Select true or false for the statements below. Explain your answers if you like to receive partial credit Select true or false for the statements below. Explain your answers if you like to receive partial credit Which of the following is true about searching elements in an unordered array? With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2) Which of the following is true about searching elements in an ordered array? You cannot use binary search on an ordered array so the performance is O(n) If there are no holes in the array and the elements are all next to each other, then the performance for search improves to…
The code below computes the intersection (the number of entries shared by two arrays). It is assumed that neither array contains any duplicates. It computes the intersection by sorting one array (array b) and then iterating over array a to see if each value is in b (through binary search). What is its duration? nt intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
Transcribed Image Text Write a for loop to populate array userGuesses with NUM_GUESSES integers. Read integers using scanf. Ex: If NUM_GUESSES is 3 and user enters 9 5 2, then userGuesses is {9, 5, 2}. 324758.2040686.qx3zgy7 1 #include <stdio.h> 2 3 int main(void) { const int NUM_GUESSES = 3; int userGuesses[NUM_GUESSES]; int i; 4 7 8 * Your solution goes here */ 9 for (i = 0; i < NUM_GUESSES; ++i) { printf("%d ". } 10 11 userGuesses[i]); 12 13 14 return 0; 15
C++ 2D ARRAY, Continue this codes and change the array to seat[6][6]. Include a loop that asks the user if he wants to try again or no. If the user enters the reserved seat again then display "this seat is taken already". Upon trying again, the reserved seat displayed as (X) must be displayed. My Code: #include <iostream> using namespace std; int main() { cout << "Bus Seats:\n"; cout << "* A B C D\n" << "1 * * * *\n" << "2 * * * *\n" << "3 * * * *\n" << "4 * * * *\n"; char seat[5][5]; int row, column; char col; cout << "Enter the row of your selected seat: "; cin >> row; cout << "Enter the column of your selected seat: "; cin >> col; for(int i=0; i<5; i++){ for(int j=0; j<5; j++){ if(i==0){ switch (j) { case 0: seat[i][j]='*'; break; case 1: seat[i][j]='A'; break; case 2: seat[i][j]='B'; break; case 3: seat[i][j]='C'; break; case 4: seat[i][j]='D'; break; } } else if (j==0) { switch(i) { case 1: seat[i][j]='1';…
Write a program that defines a multidimensional array $clubs that stores information about four football clubs, including the name, and the year founded. The program should print the contents of the array using a foreach loop. The program should also sort the array by the club name using the sort() function. Finally, it should print the sorted array.Complete the code:<?php// Define a multidimensional array$clubs = array(array("Newcastle United","England", 1892),array("Gezira Sporting Club", "Egypt", 1882),array("Zamalek Sporting Club", "Egypt", 1911),array("Bidvest Wits South Africa", "Egypt", 1921));// Print the contents of the arrayecho "List of football clubs:\n";foreach ( //Add code) {//Add code}// Sort the array by the first columnsort(//Add code);// Print the sorted arrayprint_r(//Add code);?>

SEE MORE QUESTIONS

Recommended textbooks for you

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

Microsoft Visual C#

Computer Science

ISBN:

9781337102100

Author:

Joyce, Farrell.

Publisher:

Cengage Learning,

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

New Perspectives on HTML5, CSS3, and JavaScript

Computer Science

ISBN:

9781305503922

Author:

Patrick M. Carey

Publisher:

Cengage Learning

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:

9781337102124

Author:

Diane Zak

Publisher:

Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

Microsoft Visual C#

Computer Science

ISBN:

9781337102100

Author:

Joyce, Farrell.

Publisher:

Cengage Learning,

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

New Perspectives on HTML5, CSS3, and JavaScript

Computer Science

ISBN:

9781305503922

Author:

Patrick M. Carey

Publisher:

Cengage Learning

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:

9781337102124

Author:

Diane Zak

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS

GET THE APP

About FAQ Academic Integrity Sitemap Document Sitemap

Contact Bartleby Contact Research (Essays)High School Textbooks Literature Guides Concept Explainers by Subject Essay Help Mobile App

GET THE APP

Privacy

Your CA Privacy Rights

Your NV Privacy Rights

About Ads

Manage My Data

bartleby, a Learneo, Inc. business

	a.	minVal = 0; / userVal > minVal
	b.	<code>minVal = 0; / userVal < minVal</code>
	c.	minVal = userVals[0]; / userVals[i] > minVal
	d.	<code>minVal = userVals[0]; / userVals[i] < minVal</code>