Write a program to generate an array of n integegers (n > 0, input from keyboard) which take random values within the range [-10 .. 10] then remove all elements which duplicate with the max value of the array, resize the array after complete. Example: a = {1 -5 4 9 8 72909 1} (max value is 9) → new array = {1 -5 4 9 87 20 1}

Write a program to generate an array of n integegers (n > 0, input from keyboard) which take random values within the range [-10 .. 10] then remove all elements which duplicate with the max value of the array, resize the array after complete. Example: a = {1 -5 4 9 8 72909 1} (max value is 9) → new array = {1 -5 4 9 87 20 1}

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Q3. Given an array of integers of an arbitrary number of elements, write a program that creates an array with the elements "rotated left" according to an integer denoting the shift. so [1, 2, 3] with shift 1 yields [2, 3, 1] and [1, 2, 3] with shift 2 yields [3, 1, 2].
An array int[] intArray can be initialized during its definition by A.) It can't be initialized B.) by writing int[] intArray = {1.0f}; C.) by writing int[] intArray = {0,1,2}; D.) by writing int[0-10] intArray = {0,1,2,3,4,5,6,7,8,9};
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
4. Consider the array intArr below, which has been filled with random numbers. Fill in the code to sort the array from smallest to largest. Random rand = new Random (); int [] intArr = new int [50]; for (int i = 0; i< intArr . length ; i++) { intArr (i) = rand . nextint (50) ; }
1. Write a program that fills an array with 10 random integer values between O and 100, your program should then calculate and print the alternating sum of all elements in the array. for example, if the array values are (89, 35, 44, 61, 66, 52, 45, 16, 48, 73) then the sum will = 89- 35 + 44 - 61 + 66- 52 + 45 - 16 + 48 - 73 = 55. Sample Run: The generated numbers are: 2 11 44 38 66 72 38 67 43 13 The alternating sum is -8 2. Write a program that reads 10 characters from user and store them in an array. Then display one or more of the following messages: 1. All characters are letters 2. All letters in the list are upper 3. There is no vowel letter in the list 4. There is at least 2 digits in the list 5. There is at least 3 symbols in the list Sample run 1: Enter 10 characters: AB1OK8 M& ? All letters in the list are upper There is at least 2 digits in the list There is at least 3 symbols in the list
Create a array of size n and poulate it with random numbers in range @ to 100. Print the array after populating. Take n as input by user. Write whole code in main function only.Given n>=1 and n
Return the maximum value from the provided integer array. You may assume that all values in the array will be non-negative. getMax([1]) → 1getMax([0, 3, 2, 12, 4]) → 12getMax([15, 3, 1, 7, 2]) → 15 public int getMax(int[] nums) { Write your code in here using this outline.}
C Program Find median number/s from given array. Ignore duplicates. Example 1: Input: 8 3 4 2 9 Output: 4 Explanation: When sorted, input becomes 2 3 4 8 9. The median number from the five numbers is 4. Example 2: Input: 9 2 3 5 5 4 7 1 8 Output: 4 and 5 Explanation: When sorted, input becomes 1 2 3 4 5 7 8 9. The median numbers from the eight numbers is 4 and 5.
JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true
2. Write a program that will load A with 15 random numbers (range : 1-50). Display elements of A in ascending order. Then get a number X. Compare X to each element of A, if array element is less than X, replace that element with X. On another line, display elements of A after replacing all elements less than X with X.
JAVAWrite a program that searches person's name and display all matched name. For example, if a user inputs the letter "Davis", the program searches all name which includes "Davis" in an array. Then, display all matched names on the screen. You must declare a single dimensional array which has all people’s name. Use methods of string class
this is insturction Write a program which prompts the user to enter up to 15 floating point numbers (terminated with a non-numeric), reads them into an array, then prints the following. The program must use an array (not a vector) to get credit. The array values in the original order, separated by commas, with no trailing comma at the last value. The array values where the order of each adjacent pair of elements is swapped, separated by commas (NOT every element swapped with its next neighbor, which would just move the first element to the end, but every original pair swapped only in that pair. For an odd element count, the last element should not change. See examples below.) The smallest number in the array. Example program outputs with user input shown in bold font: Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 # Original array: 1, 0, -1.001 The swapped array: 0, 1, -1.001 Smallest number: -1.001 Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 5 ,…