Print the scores in: • (1) original order, • (2) sorted from high to low, • (3) the highest score, (4) the lowest score, and (5) the average of the scores. Implement the following functions using the given function prototypes: • void displayArray(int array[], int size) - Displays the content of the array • void selectionSort(int array[], int size) - sorts the array using the selection sort algorithm in descending order. Hint: refer to example 8-5 in the textbook. • int findMax(int array[], int size) - finds and returns the highest element of the array • int findMin(int array[], int size) - finds and returns the lowest element of the array • double findAvg(int array[], int size) - finds and returns the average of the elements of the array

Print the scores in: • (1) original order, • (2) sorted from high to low, • (3) the highest score, (4) the lowest score, and (5) the average of the scores. Implement the following functions using the given function prototypes: • void displayArray(int array[], int size) - Displays the content of the array • void selectionSort(int array[], int size) - sorts the array using the selection sort algorithm in descending order. Hint: refer to example 8-5 in the textbook. • int findMax(int array[], int size) - finds and returns the highest element of the array • int findMin(int array[], int size) - finds and returns the lowest element of the array • double findAvg(int array[], int size) - finds and returns the average of the elements of the array

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 23PE

See similar textbooks

Similar questions

Write a function named(difference), that accepts an integer one-dimensional array and its size, returns the difference between the largest element and the smallest element. e.g. the array is [1,7,13,22,15,6,4,3,2,9,21] the output is:21
Develop program to read as many test scores as the user wants from the keyboard (assuming at most 50 scores). Print the scores in (1) original order, (2) sorted from high to low (3) the highest score, (4) the lowest score, and (5) the average of the scores. Implement the following functions using the given function prototypes: void displayArray(int array[], int size) - Displays the content of the array void selectionSort(int array[], int size) - sorts the array using the selection sort algorithm in descending order. Hint: refer to example 8-5 in the textbook. int findMax(int array[], int size) - finds and returns the highest element of the array int findMin(int array[], int size) - finds and returns the lowest element of the array double findAvg(int array[], int size) - finds and returns the average of the elements of the array Name your file FirstInitialLastName_CW_8. cpp Submit: Submit flowchart/Algorithm/Pseudocode C++ file (source code): FirstInitialLastName_CW_8.…
Write a program to read as many test scores as the user wants from the keyboard (assuming at most 50 scores). Print the scores in (1) original order, (2) sorted from high to low (3) the highest score, (4) the lowest score, and (5) the average of the scores. Implement the following functions using the given function prototypes: void displayArray(int array[], int size) - Displays the content of the array void selectionSort(int array[], int size) - sorts the array using the selection sort algorithm in descending order. Hint: refer to example 8-5 in the textbook. int findMax(int array[], int size) - finds and returns the highest element of the array int findMin(int array[], int size) - finds and returns the lowest element of the array double findAvg(int array[], int size) - finds and returns the average of the elements of the array
Write a function is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
C++ Write a function, insertAt, that takes four parameters: an array of integers, the number of elements in the array, an integer (say, insertItem), and an integer (say, index). The function should insert insertItem in the array provided at the position specified by index. If index is out of range, output the following: Position of the item to be inserted is out of range or if the index is negative: Position of the item to be inserted must be nonnegative (Note that index must be between 0 and the number of elements in the array; that is, 0 <= index < the number of elements in the array.) Assume that the array is unsorted. int list[ARRAY_SIZE] = {4, 33, 25, 68, 50, 30, 63, 47, 54, 86, 82, 71};
Write a function called largest_sum_sequence() that accepts an array of signed integers and the number of items in the array as parameters, and returns the largest sum of a sequence of numbers in the array. A sequence is defined as a single item or multiple items that are in consecutive adjacent memory locations. Example 1: 9 3 -1 7 -12 largest sum in sequence is 18 [9, 3, -1, 7] Example 2: -77 3 -2 1 largest sum in sequence is 3 [3]
Q4: Write a program using funcions, write saperate functions for input and output, program should take input 10 numbers in an array, counts the zeros, even and odd numbers in array. Finally prints the total number of zeros, even and odd numbers.
Given an array of integers, write a function to find the second largest number in the array. The function should return -1 if the array has less than two elements. Function signature: int second_largest(int arr[], int size) Example: Input: arr = [1, 2, 3, 4, 5], size = 5 Output: 4 Input: arr = [1], size = 1 Output: -1 Notes: The function should work for arrays of any size. You can assume that the elements of the array are unique and not sorted in any particular order. This problem requires the use of loops, conditional statements, and basic array operations, and it can be solved using a variety of algorithms. A brute-force approach would be to compare each element with all other elements in the array to find the largest and second largest numbers, but this would have a time complexity of O(n^2). A more efficient solution would be to use a single loop to iterate through the array, updating the values of the largest and second largest numbers as needed.
Write a function which solves a projectile problem. As input, the function will take the initial height (y0) from which the projectile is launched, the initial velocity, and the angle in degrees which the initial velocity makes with the horizontal (positive if above the horizontal, negative if below the horizontal). The function should calculate the time T the projectile stays in air, generate a time array (0, T/100, 2T/100, 3T/100, …, T), and return the values of x and y (the components of the position vector of the projectile) at the times in the array. Plot the projectile trajectory using matplotlib. Use phyton language pls put output screenshot import mathimport numpy as npimport matplotlib.pyplot as plt%matplotlib inline
Write a function which solves a projectile problem. As input, the function will take the initial height (y0) from which the projectile is launched, the initial velocity, and the angle in degrees which the initial velocity makes with the horizontal (positive if above the horizontal, negative if below the horizontal). The function should calculate the time T the projectile stays in air, generate a time array (0, T/100, 2T/100, 3T/100, …, T), and return the values of x and y (the components of the position vector of the projectile) at the times in the array. Plot the projectile trajectory using matplotlib. Use phyton language
Write a C function called printOddsInReverse that accepts an integer array and the number of items in the array. The function must go through the array in reverse order and only print the odd numbers.
Write a program to pass an integer array of 10 elements to a function which returns the same array after sorting it in descending order. Print the array.