Answer:
Multiply(m,n)
1. Initialize product=0.
2. for i=1 to n
3. product = product +m.
4. Output product.
Explanation:
Here we take the variable "product" to store the result m×n. And in this algorithm we find m×n by adding m, n times.
Answer:
// A optimized school method based C++ program to check
// if a number is composite.
#include <bits/stdc++.h>
using namespace std;
bool isComposite(int n)
{
// Corner cases
if (n <= 1) return false;
if (n <= 3) return false;
// This is checked so that we can skip
// middle five numbers in below loop
if (n%2 == 0 || n%3 == 0) return true;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return true;
return false;
}
// Driver Program to test above function
int main()
{
isComposite(11)? cout << " true\n": cout << " false\n";
isComposite(15)? cout << " true\n": cout << " false\n";
return 0;
}
Explanation:
A. computer
computer because computer is technology and pencil is not and spoon.
