Soup b; no
soup c; yes
soup d; no
soup e; yes
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;
}
Answer:
d. about 50 times larger
Step-by-step explanation:
The given expressions for magnitude (M) can be solved for the intensity (I). Then the ratio of intensities is ...
The larger earthquake had about 50 times the intensity of the smaller one.
Answer:
200,000
Step-by-step explanation:
The number Evan could be thinking about is 200,000. I got this number because the value of the digit 2 in the number 328,907 is 20,000. Also, the number Evan is thinking about is 10 times the value of 20,000. So, I did 20,000 times 10 and got 200,000.
D. It is not a function because there are multiple outputs for one input.
