double median()//Before calculating the median, we must sort the//array.//If the array is even...if (numbers.size() % 2 -- 0){//Get the mid indexint mid - numbers.size()/ 2;//Get the two numbers in the mid. (mid is the index of the right most middle number.)//Get mid ar'd mid - 1double numl - numbers [mid];double num2 = numbers [mid - 1];//Calculate the average of the two middle numbers and return//the average.return average_mid;else//Determine the median index and return the//number at the median.int mid - numbers.size() /2;return numbers [mid];}//Sorts the array in ascending order.void BubbleSort)for (int i - 0; i < numbers.size(); i++){bool swapped false;for (int j - 0; j< numbers.size() - i - 1; j++{if (numbers[j] > numbers[j + 1]swap(numbers[), numbers[j + 11);swapped - true;if (swapped -- false)return;}private://Used only in Bubble Sort. Ignore...void swap(double& a, double& b){double temp- a;a - b;b - temp;};int main)VCreate a StatSet variable called "s".//Add the number "55" to the StatSet "s".//Calculate the median of the numbers.return 0;PIC CO #include #include using std::cout;using std::vector;class StatSet{private:HCreate a vector of doubles that is called "numbers."public://Nothing to do in the constructor.StatSet()}// Add a new number to the set.vòid add_num(double num){}double mean(){//Sum up the values and return the average.double sum = 0;//Write a loop that would iterate through the vector.sum += numbers[i];return sum / numbers.size();}double median()//Before calculating the median, we must sort the//array.

The given problem is related to C++, where the partially compelete code is given and the requirement…

//Before calculating the median, we must sort the 1/array. //1f the array is even... if (numbers.size() X 2 -- 0) //Get the mid index int mid - numbers.size() / 2; //Get the two numbers in the mid. (mid is the the right most middle number.) //Get mid anid mid- 1. double numl - numbers(mid]; double num2 - numbers(mid - 1]; T/Calculate the average of the two middle num return //the average.

//Before calculating the median, we must sort the 1/array. //1f the array is even... if (numbers.size() X 2 -- 0) //Get the mid index int mid - numbers.size() / 2; //Get the two numbers in the mid. (mid is the the right most middle number.) //Get mid anid mid- 1. double numl - numbers(mid]; double num2 - numbers(mid - 1]; T/Calculate the average of the two middle num return //the average.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: The contents of the array below represent a maxHeap. What would be the contents of the array after…

Q: In Quick Sort, the function Partition is used to arranged the values into the S1 set and S2 set…

A: Select a pivot. Split: Splits the task set, moving smaller pieces to the left of the pivot and…

Q: Lab Goal : This lab was designed to teach you more about sorting. Lab Description : Create a…

A: Answer

Q: nt array[] = {1. 2, 3}:

A: Here array "array" is an array of integer.

Q: the following lab by one dimensional array(not vector) define two lists of numbers (arrays) and ask…

A: Question1: Do the following lab by one dimensional array(not vector) define two lists of numbers…

Q: Declare an integer array named primes with 5 elements. Initialize this array with the first five…

A: The Answer is in step2

Q: def sum_threshold_2d_array(array, threshold): """ Iterate through each element of the 2d array using…

A: Iterate through each element of the 2d array using nested loops.Sum up the values that are greater…

Q: Q24: Create the array (b) from (a). 1 23 456 10 7 8 9 10

A: We have 2 arrays. One is a 3x3 2-d array and another is a 1-d array. We need to create an array (b)…

Q: The complexity of an Array’s __str_() method is O(n). Question 15 options: False True

A: The __str()__ method converts the specified array to a string It simply returns a simple statement…

Q: 1. Create a size-specific array of ones (10 , 1). Put the result into the bias array variable.

A: “Since you have asked multiple questions, we will solve the first question for you. If you want any…

Q: 2. For the following array, you are to perform a binary search: Int nums[ ]= (1, 13, 78, 89, 96,…

A: Binary search is applied on a sorted array and the time complexity is O(logn) to search a element.

Q: Consider the array below please provide the intermediate array applying the Count Sort Algorithm…

A: Counting sort is a sorting technique based on keys between a specific range. It works by counting…

Q: Description of the assignment: Your program should read in a set of grades (that are all integers)…

A: #include <stdio.h>#include <math.h> void readGrades(double grades[], int* n);void…

Q: How does one go about keeping track of items that have data while working with an array that is only…

A: When working with an array that is only half populated, it can be challenging to keep track of the…

Concept explainers

Array

The simplest way to start thinking about an array is as a collection, or a set of elements. In programming, these elements may be constants, variables, functions and pointers.

Question

double median()
//Before calculating the median, we must sort the
//array.
//If the array is even...
if (numbers.size() % 2 -- 0)
{
//Get the mid index
int mid - numbers.size()/ 2;
//Get the two numbers in the mid. (mid is the i
ndex of the right most middle number.)
//Get mid ar'd mid - 1
double numl - numbers [mid];
double num2 = numbers [mid - 1];
//Calculate the average of the two middle numbe
rs and return
//the average.
return average_mid;
else
//Determine the median index and return the
//number at the median.
int mid - numbers.size() /2;
return numbers [mid];
}
//Sorts the array in ascending order.
void BubbleSort)
for (int i - 0; i < numbers.size(); i++)
{
bool swapped false;
for (int j - 0; j< numbers.size() - i - 1; j++
{
if (numbers[j] > numbers[j + 1]
swap(numbers[), number
s[j + 11);
swapped - true;
if (swapped -- false)
return;
}
private:
//Used only in Bubble Sort. Ignore...
void swap(double& a, double& b)
{
double temp- a;
a - b;
b - temp;
};
int main)
VCreate a StatSet variable called "s".
//Add the number "55" to the StatSet "s".
//Calculate the median of the numbers.
return 0;
PIC CO

#include <iostream>
#include <vector>
using std::cout;
using std::vector;
class StatSet
{
private:
HCreate a vector of doubles that is called "numbers."
public:
//Nothing to do in the constructor.
StatSet()
}
// Add a new number to the set.
vòid add_num(double num)
{
}
double mean()
{
//Sum up the values and return the average.
double sum = 0;
//Write a loop that would iterate through the vector.
sum += numbers[i];
return sum / numbers.size();
}
double median()
//Before calculating the median, we must sort the
//array.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Introduction

VIEW

LOGIC

VIEW

Complete code with blanks filled in it

VIEW

Screenshot

VIEW

Output

VIEW

Step by step

Solved in 5 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Programming language: Processing from Java Question attached as photo Topic: Use of Patial- Full Arrays
Construct a row array countValues from 0 to 25, elements incremented by incrementValue. Ex: If incrementValue is 5, countValues should be [0, 5, 10, 15, 20, 25].
Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 int last0f(const int a[], int alen, const int b[], int bLen) { 3 4 5 6 7 8 }
If an array variable is declared as score[7] then the valid range of array indexes for score is 0...7 Select one: True False