A.) 135 miles in 3 hours = 45 miles per hr
B.) 22 miles in 1 hour= 22 miles per hr
C.) 7.5 miles in 1/4 hour = 30 miles per hr
D.) 100/3 in 2/3 hour = About 49.9 mph
E.) 97.5 in 1.5 hours = 65 miles per hr
Answer:
Algorithm
Start
Int n // To represent the number of array
Input n
Int countsearch = 0
float search
Float [] numbers // To represent an array of non decreasing number
// Input array elements but first Initialise a counter element
Int count = 0, digit
Do
// Check if element to be inserted is the first element
If(count == 0) Then
Input numbers[count]
Else
lbl: Input digit
If(digit > numbers[count-1]) then
numbers[count] = digit
Else
Output "Number must be greater than the previous number"
Goto lbl
Endif
Endif
count = count + 1
While(count<n)
count = 0
// Input element to count
input search
// Begin searching and counting
Do
if(numbers [count] == search)
countsearch = countsearch+1;
End if
While (count < n)
Output count
Program to illustrate the above
// Written in C++
// Comments are used for explanatory purpose
#include<iostream>
using namespace std;
int main()
{
// Variable declaration
float [] numbers;
int n, count;
float num, searchdigit;
cout<<"Number of array elements: ";
cin>> n;
// Enter array element
for(int I = 0; I<n;I++)
{
if(I == 0)
{
cin>>numbers [0]
}
else
{
lbl: cin>>num;
if(num >= numbers [I])
{
numbers [I] = num;
}
else
{
goto lbl;
}
}
// Search for a particular number
int search;
cin>>searchdigit;
for(int I = 0; I<n; I++)
{
if(numbers[I] == searchdigit
search++
}
}
// Print result
cout<<search;
return 0;
}
The median would be the middle data point. Let’s list the points
25, 26, 31, 39, 32, 57
Put them in order from least to greatest
25, 26, 31, 32, 39, 57
There is an even amount of data so take the two center points and divide by 2
31 + 32 = 63
Divide by 2
31.5
There would be an average of 31.5 strokes
1. c
2. c again hope this helps and plz mark as brainliest
