Answer:
i dont get it
Step-by-step explanation:
Equal to! If we have a decimal and we add a zero onto the END, the value will not change! The values will only change if you change the place values. Now, this is only with decimals!!
Answer:
-24
Step-by-step explanation:
Answer:
"The next term should be 11"
Step-by-step explanation:
If we look closely at the sequence we can see:
second term is 3 more than previous
third term is 2 less than previous
fourth term is 3 more than previous
fifth term is 2 less than previous
We can see a pattern. To get next terms, we add 3, to get next to that, we subtract 2. It goes on like this.
Since 4th term to 5th term is "subtracting 2", logically 5th to 6th term (the term we are wanting) should be "add 3". So the term after 8 would be 11
The next term would be 11
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;
}
