Inline Function In cpp

Inline Function In cpp

PROGRAM:

#include<iostream>
#include<stdio.h>
using namespace std;
inline int addition(int a,int b){
        return (a+b);
}
int main(){
int x,y,add;
char ch;
do{
cout<<"Enter NUM1 & NUM2 : ";
cin>>x>>y;
add=addition(x,y);//!the compiler places a copy of the code here
cout<<"\nNUM1 + NUM2 : "<<add;
cout<<"\n\t\t\t Enter y to continue : ";
cin>>ch;
}while(ch=='y');
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Introduction to ChatGPT: Explain what ChatGPT is, how it works, and what it is used for.

Introduction to ChatGPT ChatGPT is an AI language model developed by OpenAI that is based on the GPT (Generative Pre-trained Transformer) architecture. It is designed to generate natural language text that is both coherent and contextually relevant. ChatGPT is trained on a vast amount of text data, including books, articles, and websites. During training, it learns the patterns and structures of natural language and uses this knowledge to generate text in response to prompts. The model works by predicting the most probable next word in a sequence of words based on the previous words in the sequence. It does this by assigning a probability score to each word in its vocabulary based on the context of the prompt. The word with the highest probability score is then selected as the next word in the sequence. This process is repeated until the desired length of the text is generated. ChatGPT is used for various applications, including chatbots, content generation, language translation, an...
Read more

Multi Level Inheritance In cpp

Multi Level Inheritance In cpp PROGRAM: #include<iostream> using namespace std; class A{ public: A(){ cout<<"\n grand parent"; } }; class B:public A{ public: B(){ cout<<"\n parent1"; } }; class C:public B{ public: C(){ cout<<"\n child"; } }; int main(){ C c; return 0; }
Read more

Binary search in C

Image
Binary search in C Binary Search: in computer science,  binary search , also known as half-interval  search , logarithmic  search , or  binary chop, is a  search  algorithm that finds the position of a target value within a sorted array. It necessary that given data is sorted in ascending order or descending order. below is the program of binary search for ascending ordered data. PROGRAM   : #include <stdio.h> #include <stdlib.h> int main(int n,int a[10]) { int i,mid,key,ub,lb; printf("How many numbers you wants to enter="); scanf("%d",&n); lb=0; ub=n-1; printf("\n%d elements are=",n); for(i=0;i<n;i++){ printf("\na[%d]=",i); scanf("%d",&a[i]); } printf("\nKey=",n); scanf("%d",&key); mid=(lb+ub)/2; while(a[mid]!=key && lb<=ub){ if(key<a[mid]){ ub=mid-1; } ...
Read more