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;
}
4x+(-3)=-2x-5
4x-3 = -2x-5
add 2x to each side
6x-3 =-5
add 3 to each side
6x = -2
divide by 6
x = -2/6
divide top and bottom by 2
x = -1/3
Answer:
B
Step-by-step explanation:
Just answer it
BBSJSSJJSNSNNSOAOOALAKA
Answer:
y = (3/2)x + 11/2
Step-by-step explanation:
As we move from the point (-3, 1) to the point (3, -3), x increases by 6 and y decreases by 4. Thus, the slope is
m = rise / run = 6/4 = 3/2.
Subbing the knowns into the general point-slope form of the equation of a straight line, we get
y - 1 = (3/2)(x - [-3]), or y - 1 = (3/2)(x + 3).
This is equivalent to y = (3/2)x + 9/2 + 1, or y = (3/2)x + 11/2.
1. Did it mentally think it’s 16. Make sure to yield to order of operations.
2. Because none of the operations are multiplication or division, parenthesis can be put anywhere that isn’t between exponents and it will yield 22.
