Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
the answer should be the letter a
I'm pretty sure the answer is b
Answer:
Written in C++
void number(int n){
if(n%2 == 0)
cout<<2 * n;
else
cout<<5 * n;
}
Explanation:
The programming language is not stated.
However, I answered using C++
This line defines the function as void
void number(int n){
This line checks if the number is even
if(n%2 == 0)
If yes, it doubles the number and prints the output
cout<<2 * n;
If otherwise,
else
It multiplies the number by 5 and prints the output
cout<<5 * n;
}
To call the function from main, use:
number(n);
Note than n must be declared as integer
See attachment
Answer:
This is not what this platform is supposed to be used for
Explanation:
Fortnite isnt a real game lol get a life
