Select the (worst-case) order for each of the following tasks (using intelligent programming practices)? Displaying all strings in a two-dimensional array with (n by m elements) Displaying all n integers in an array Computing the sum of the first n even integers (using a for loop) Displaying one array element Displaying all n integers in a sorted array

Select the (worst-case) order for each of the following tasks (using intelligent programming practices)? Displaying all strings in a two-dimensional array with (n by m elements) Displaying all n integers in an array Computing the sum of the first n even integers (using a for loop) Displaying one array element Displaying all n integers in a sorted array

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

This program inputs ten integers into an array (a) and then create a new array (b) that represent reverse order of array (a). For i = 1 To 10 1-.. Next 2- 3-. Next 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step 1 3-b(i)= a(11 - i) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(10 - i) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(11 - i) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(i-11) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(11+i) 1-b(i) = InputBox("b") 2-For i = 10 To 1 Step -1 3-b(i) = a(11 - i) O O Hints
A prime number is any integer that is evenly divisible only by itself and 1. The Sieve ofEratosthenes is a method of finding prime numbers. The algorithm is described below.• Create an array with all elements initialized to 1 (true). Array elements with primesubscripts will remain 1. All other array elements will eventually be set to zero.• Starting with array subscript 2, every time an array element i is found whose value is 1,loop through the remainder of the array and set to zero every element whose subscript is amultiple of i. For array subscript 2, all element beyond 2 in the array that are multiples of2 will be set to zero (subscripts 4, 6, 8, 10, etc.); for array subscripts 3, all elements beyond3 in the array that are multiples of 3 will be set to zero (subscripts 6, 9, 12, 15, etc.); and soon.When this process is complete, the array elements that are still set to one indicate that the subscriptis a prime number. These subscripts can then be printed. Write a program that uses…
This program inputs ten integers into an array (a) and then create a new array (b) that represent reverse order of array (a). For i = 1 To 10 1-. Next 2-. 3-. Next 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step 1 3-b(i) = a(11 - i) 1-a(i)= InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(11 - i) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(11+i) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i)= a(10 - i) 1-b(i)= InputBox("b") 2-For i = 10 To 1 Step -1 3-b(i) = a(11 - i) 1-a(i) = InputBox("a") 2-For i = 10 To 1 Step -1 3-b(i) = a(i-11) S 00 00
Compute the distance between the positions of the first and last zero element in the given array. For example if the array is 3 0 1 0 4 9 5 0 6 your algorithm should yield 7 - 1 = 6. If the array contains a single zero return 0. If it doesn’t contain any zeros return a negative value Only edit code within the /*Your code goes here*/ portion.
This program separates odd and even integers in separate arrays. For i = 1 To 10 al(i) = Next 1- For i = 1 To 10 2-. 3- j = j + 1 k = k + 1 1-j = 0: k = 0 2-lf a1 (i) Mod 2 = 0 Then 3- a2(j) = a1 (i) 4-a3(k)= a1 (i) 1-j = 1: k = 1 2-lf a1 (i) Mod 2 = 0 Then 3- a2(j) = a1 (i) 4-a3(k) = a1(i) 1-j = 1: k = 1 2-lf a1 (i) Mod 2 >< 0 Then 3- a2(j) = a1 (i) 4-a3(k) = a1 (i) 1-j = 1: k = 1 2-lf a1 (i) Mod 2 = 0 Then 3- a2 (i) = a1 (i) 4-a3(i) = a1(i) 1-j = 1: k = 1 2-lf a1 (i) Mod 2 = 0 Then 3- a2(k)= a1 (i) 4-a3(j) = a1(i) Else 4-. End If Next O O O O O visual Basic InputBox("")
Consider an 8 x 8 array for a board game: int board[8][8]; Using loops, initialize the board so that zeroes and ones alternate, as on a checkerboard: 0 101 010 1 101010 10 0 101 0101 10101 010
Write a java program that: 1. Creates an array A of 6 integers 2. Fill such array with values between 100 and 1000 both inclusive 3. Find and print the minimum element with even values 4. Compute and print the average of values multiples of 4 Sample Output Run Fill array A with 6 integers: 100 9. try Again..Number not in range ( 100 ->1000): 908 178 977 758 230 The min element with even value: 100 The average of values multiples of 4 is 504
Compute the distance between the positions of the first and last zero element in the given array. For example, if the array is 3 0 1 0 4 9 5 0 6 your algorithm should yield 7 - 1 = 6. If the array contains a single zero, return 0. If it doesn't contain any zeroes, return a negative value. JAVA CODING
Python Write a Python program that performs a linear (sequential) search. Define an array of 10 non-sequential numbers. Ask the user for a number, such as "Enter a number to be found:" Search the array for the user's number. If present, display "Successful search, the element is found at position " and its position. Otherwise, display "Number not found."
JAVA PROGRAM Create a program that accepts a positive odd integer input then create an integer array with a size equal to the inputted number. Using loops, add integer values into the array by asking for a user input repeatedly until the last allocable index of the array. Traverse the array and print the element. Note: Input should be positive odd number. Input is greater than or equal to three. Example: INPUT: Enter array size: 7 Enter element 1: 1 Enter element 2: 5 Enter element 3: 2 Enter element 4: 3 Enter element 5: 9 Enter element 6: 0 Enter element 7: 4 OUPUT: {1, 5, 2, 3, 9, 0, 4}
The Sieve of Eratosthenes is an algorithm that finds all prime numbers up to a given limit, n. It works by creating an array of Booleans, flag, of size n+1, initializing the array to true (assuming every number is a prime number in the beginning), and iteratively traversing the numbers from 2 to n, setting the values of indices that are multiples of other numbers to false. Write a program using the algorithm above, and display all the prime numbers up to 50.
Implement a main method that profiles the performance of insert and outputs a table showing the average time per insert as the length of the array increases. Pseudocode: // Setting to allow fine-tuning the granularity of the readings Let NUM READINGS = 60 Let INSERTS PER READING = 1000 // Start with an array containing 1 element Let array = new array containing one element having value 0 // Take NUM_READINGS readings Loop NUM READINGS times. // Each reading will be taken after INSERTS PER READING inserts Let startTime = current time Loop INSERTS PER READING times Let index = random integer in range [0, array.length) Let value = random integer value Let array = Homework1.insert (array, index, value) End Loop Let stopTime = current time Let time PerInsert = (stopTime startTime) / INSERTS PER READING // Output reading in tabular format Output array length and time Per Insert End Loop Report format: Your program should output a report similar to the format below (your values will be…