Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output [0] = 4 [1] = 24 [2] = 123 [3] = 54 [4] = 3 Array: 4 24 123 54 3 Max: 123 Min: 3

Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output [0] = 4 [1] = 24 [2] = 123 [3] = 54 [4] = 3 Array: 4 24 123 54 3 Max: 123 Min: 3

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 11PE

See similar textbooks

Similar questions

6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
2. Search and Rescue by CodeChum Admin Make a program that will accept an integer and loop for the same number of times as that of the inputted integer and input random integers and add it to the array/list one by one, per line. Afterwards, make your program accept another random integer. Using that final integer, compare from your array/list if the final integer's value is also present in your current array/list. If so, print "Present"; otherwise, print "None". Start coding now! Input The first line contains the size of the array/list. The next lines contain the integers. The last line contains an integer to be searched. 5 3 21 2 5 23 2 Output A line containing a string. Present -USED JAVA PROGRAMMING LANGUAGE
Read in an integer n (n < 25). Read n integers in an array A. Then do the following (writeseparate programs for each, only the reading part is common).a) Find the sum of the absolute values of the integers.b) Copy the positive and negative integers in the array into two additional arrays B and Crespectively. Print A, B and C.c) Exchange the values of every pair of values from the start (so exchange A[0] and A[1],A[2] and A[3] and so on). If the number of elements is odd, the last value should stay thesame.
Read in an integer n (n < 25). Read n integers in an array A. Then do the following (writeseparate programs for each, only the reading part is common).a) Find the sum of the absolute values of the integers.b) Copy the positive and negative integers in the array into two additional arrays B and Crespectively. Print A, B and C.c) Exchange the values of every pair of values from the start (so exchange A[0] and A[1],A[2] and A[3] and so on). If the number of elements is odd, the last value should stay thesame.write c program
4. Write a program to find kth smallest element in unsorted array?You are given an unsorted array of numbers and k, you need to find the kth smallest number in the array. Forexample if given array is {1, 2, 3, 9, 4} and k=2 then you need to find the 2nd smallest number in the array,which is 2.
Hello, I am having trouble with this homework. Random modification of all elements in an integer array.a) Initialize an integer array of capacity 5.b) Implement an array print function.c) Print the array to the console.d) Implement an offset function that accepts an integer array as inputand randomly modifies each element by up to +/- 5.e) Use the offset function to update the array.f) Print the modified array. Example Output (input in bold italics) Original: 5 1 4 9 2Offset: 7 -2 6 11 4
C++ 1- Creating an array of 8 random integers /// 2- Copying the elements from the first array to another array that fulfills the following condition: The sum of the element to twice its position is less than the square of the difference between the element that follows it and the element that precedes it except for the first and last element They are copied automatically //// 3- Finds the largest even number in the first array and in what position it is found //// 4- Finds the two smallest odd numbers in the first array and in what position it is
3. Write a program to find intersection of two sorted array.For example, if the two sorted arrays as input are {21, 34, 41, 22, 35} and {61, 34, 45, 21, 11}, it should returnan intersection array with numbers {34, 21}. For the sake of this Problem, you can assume that numbers ineach integer array are unique.
Consider two arrays of Different sizes are given and your task is to multiply corresponding elements and store it into the result array and print the result array.
in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.
import math array = [4, 5, 6, 7, 8, 9, 33, 24, 15, 11] print("Original array") print(array) print() # Get no. of elements n = len(array) s = math.floor((n-1)/2) e = math.floor(n/2) # while loop while (s >= 0 and e <= n-1): # swap the numbers array[s], array[e] = array[e], array[s] s = s-1 e = e+1 # now array is reversed print("Reversed array") print(array) Check this code and ,using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size.