Answer:
625.25
Step-by-step explanation:
the answer is 625.25
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;
}
Hey there!
To solve this, divide the numbers 1/4 and 5 . . .
1/4 = 1/4
5 = 5/1
1 x 1 = 1
4 x 5 = 20
= 1/20
1/20 is already in it's simplest form, so it doesn't need to be simplified.
There are 1/20 liters of water in each glass.
Hope this helps you.
Have a great day!
The correct answer is C.
Perpendicular lines have opposite reciprocal slopes. This mean you will flip the original number upside down, and change its sign (negative to positive and vice versa). So, the opposite of -1/4 will be 4.
" the quotient " means divide
(x/3) - 4 <== ur expression
