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;
}
ik the first answer choice is false
Answer:
s=13
Step-by-step explanation:
s=5q+8
plug in numbers
s=5(1)+8
solve 5*1
s=5+8
solve 5+8
s=13
8/36
= 2/9 after dividing by 4
Please mark as brainliest.
Based on the definition of complementary angles, the two angles are: 49.4° and 40.6°.
<h3>What are Complementary Angles?</h3>
Angles that are complementary angles have a sum of 90 degrees.
Let the angle be represented as x
Complement of the angle = (90 - x)
Therefore, we would have:
x = (90 - x) + 8.8
x = 90 - x + 8.8
x = 98.8 - x
x + x = 98.8
2x = 98.8
x = 98.8/2
x = 49.4°
The second angle would be: 90 - 49.4 = 40.6°
The angles are 49.4° and 40.6°.
Learn more about complementary angles on:
brainly.com/question/16281260
#SPJ1
