Answer:
Comparison.
Explanation:
When we have to find a largest in a list of n elements.First we have to iterate over the list so we can access all the elements of the list in one go.Then to find the largest element in the list we have to initialize a variable outside the loop with the minimum value possible and in the loop compare each element with this value,if the element is greater than the variable assign the element to the variable.Then the loop will find the largest element and it will be the variable.
Answer:
tamera like from sister sister hehe
Explanation:
sorry i dont know the awnser
Answer:
Write a recursive Scheme function power(A, B) that takes two integer parameters, A and B, and returns A raised to the B power. A must be a positive value, but B maybe a negative value.
Explanation:
Answer:
#include<iostream>
using namespace std;
int main (){
int n1, n2;
cout<<"Enter 1st number";
cin>>n1;
cout<<"Enter 2nd number";
cin>>n2;
if(n1<n2){
cout<<"The 1st number is the smallest"<<endl<<" is= "<<n1;
}
else{
cout<<"The 2nd number is the smallest"<<endl<<" is= "<<n2;
}
}
return 0;
