In statistics the median of a set of values is the value that lies in the middle when the values are arranged in sorted order. If the set has an even number of values, then the median is taken to be the average of the two middle values. Write a function that determines the median of a sorted array. The function should take an array of numbers and an integer indicating the size of the array and return the median of the values in the array. You may assume the array is already sorted. Use pointer notation whenever possible.

In statistics the median of a set of values is the value that lies in the middle when the values are arranged in sorted order. If the set has an even number of values, then the median is taken to be the average of the two middle values. Write a function that determines the median of a sorted array. The function should take an array of numbers and an integer indicating the size of the array and return the median of the values in the array. You may assume the array is already sorted. Use pointer notation whenever possible.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 6PP: (Numerical) a. Define an array with a maximum of 20 integer values, and fill the array with numbers...

See similar textbooks

Similar questions

(Numerical) a. Define an array with a maximum of 20 integer values, and fill the array with numbers input from the keyboard or assigned by the program. Then write a function named split() that reads the array and places all zeros or positive numbers in an array named positive and all negative numbers in an array named negative. Finally, have your program call a function that displays the values in both the positive and negative arrays. b. Extend the program written for Exercise 6a to sort the positive and negative arrays into ascending order before they’re displayed.
(Numerical) Given a one-dimensional array of integer numbers, write and test a function that displays the array elements in reverse order.
Write a function that takes 3 arguments, all integers. // It returns an array starting with the first number and increasing by the interval until it reaches // the second number, including the second number if it is part of the pattern. // For this exercise you can assume that the first integer is strictly less than the second integer. const countWithIntervals = (start, end, interval) => { } // Examples countWithIntervals(1, 10, 2) // returns [1, 3, 5, 7, 9] countWithIntervals(5, 20, 3) // returns [5, 8, 11, 14, 17, 20] // Write a function that takes 2 arguments, both strings. // It returns as a number how many times the second string occurs within the first string. const subStringCount = (string, subString) => { } // Examples subStringCount("mississippi", "i") // returns 4 subStringCount("lions and tigers and bears", "and") // returns 2
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 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]
Write a function that returns an integer that appears most often with respect to an array of integers In the array. for example. [1 2 3 2 3 4 2 5] For an array your function must return 2.
Write a program that asks the user to input a series of numbers. Theprogram should read the numbers into an array and then does the following:a) Write a function that will find the average value in the array.b) Write a function that will find the mode value in the array.c) Write a function that will display the sorted array of numbers from maximum tominimum.d) Write a function that will search the array for a specific value.e) Write a function that will display all of this information to the user in a nice format.You should submit the flowchart and the python code for this assignment
Write a function using python: diceSim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.diceSim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281]
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
Write a function that gets an array as a parameter, sorts it in an ascending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position). Use c code int sortASC(int* myArray, int size) if array ={ 2, 3, 1, 0, -1} after calling the function the array should become {-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array)
Write a program that dynamically allocates an array large enough to hold a user defined number of test scores. Once all the scores are entered, the array should be passed to a function that sorts them in descending order and display the sorted list. Another function should be called that calculates the average score and display in the same function. Use appropriate headings for function and pointer notation rather than array notation whenever possible. Input Validation: Do not accept negative numbers for test score
Write a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like: int Search (floats a[ ], int n, float number); Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns –1 If the number to be searched is 9.8,the function returns 2 C++ language only.