Wiki is the correct answer
Answer:
29
Explanation:
for n=28:
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 28*28 + 28/2 = 798
Algorithm 2 performs f(n) = 12*28 + 500 = 836
for n=29
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 29*29 + 29/2 = 855.5
Algorithm 2 performs f(n) = 12*29 + 500 = 848
so, for n=29, algorithm 2 will be faster than algorithm 1
Answer:
the answer is true. it is a high level language
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;
Answer:
The code is given in the explanation section
Explanation:
//Class Airconditioner
public class AirConditioner {
private boolean turnOnOff;
//The Constructor
public AirConditioner(boolean turnOnOff) {
this.turnOnOff = turnOnOff;
}
//method turn_on
public void turn_on(){
this.turnOnOff = true;
}
//method turn_off
public void turn_off( ){
this.turnOnOff = false;
}
}
// A new class to test the airconditional class
class AircondionTest{
public static void main(String[] args) {
//Creating an object of the Aircondional class
AirConditioner office_a_c = new AirConditioner(false);
//Using the reference varible to call method turn_on
office_a_c.turn_on();
}
}
