A binary search can be performed only on a comparable lists
Red underline. Hope this helps.
Answer:
#include<iostream>
using namespace std;
int lcm(int m, int n) {
int a;
a = (m > n) ? m: n;
while (true) {
if (a % m == 0 && a % n == 0)
return a;
++a;
}
}
int gcd(int m, int n) {
int r = 0, a, b;
a = (m > n) ? m : n;
b = (m < n) ? m : n;
r = b;
while (a % b != 0) {
r = a % b;
a = b;
b = r;
}
return r;
}
int main(int argc, char **argv) {
cout << "Enter the two numbers: ";
int m, n;
cin >> m >> n;
cout << "The LCM of two numbers is: " << lcm(m, n) << endl;
cout << "The GCD of two numbers is: " << gcd(m, n) << endl;
return 0;
}
Explanation:
Answer:
#include <iostream>
using namespace std;
int main() {
int a[4][5];//declaring a matrix of 4 rows and 5 columns.
for(int i=0;i<4;i++)
{
for(int j=0;j<5;j++)
{
if(i==3)//initializing last row as 0.
{
a[i][j]=0;
}
else//initializing last row as 1.
{
a[i][j]=1;
}
}
}
for(int i=0;i<4;i++)
{
for(int j=0;j<5;j++)
cout<<a[i][j]<<" ";//printing the matrix.
cout<<endl;
}
return 0;
}
Output:-
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
0 0 0 0 0
Explanation:
I have created a matrix of size 4 rows and 5 columns.I have used for loops to fill the array.To fill the last row with 0 i have used if statement.else we are filling it with 1.
Answer:
In Python:
low = int(input("Low: "))
high = int(input("High: "))
if low >= 1000000000 or high >=1000000000:
print("Out of range")
else:
mylist = []
for num in range(low,high+1):
flag = False
if num > 1:
for i in range(2, num):
if (num % i) == 0:
flag = True
break
if not flag:
mylist.append(num)
print(num, end = " ")
print()
print("The twin primes are: ",end="")
count = 0
for i in range(1,len(mylist)):
if mylist[i] - mylist[i-1] == 2:
print(str(mylist[i])+" & "+str(mylist[i-1]),end=", ")
count+=1
print()
print("There are "+str(count)+" twin primes")
Explanation:
See attachment for complete program where comments were used to explain each line
