Fibonaccci Series in C++ without Recursion

#include <iostream>

using namespace std;

int main() {

int n1 =0,n2=1,n3,i,number;

cout«"Enter the number of elements:

cin»number;

cout«n1«" "«n2«"//printing 0 and 1

for(i=2;i<number;++i) //loop starts from 2 because 0 and 1 are already

printed

{ n3=n1+n2; cout«n3«" n1=n2; n2=n3;

return 0;

Fibonnaci series using recursion in C++

#include<iostream>

using namespace std;

void printFibonacci(int n){

static int n1=0, n2=1, n3;

if(n>0){

n3 = n1 + n2;

n1 = n2;
 n2 = n3;

cout«n3«" printFibonacci(n-l);

int main(){

int n;

cout«"Enter the number of elements:

cin»n;

cout«"Fibonacci Series:

cout«"0 "«"1

printFibonacci(n-2); //n-2 because 2 numbers are already printed return

0;

Prime Number Program in C++

int main() {

/* variable definition and initialization */

int n, i, c = 0;

/* Get user input */ cout « "Enter any number n:cin»n;

/*logic*/ for (i = 1; i <= n; i++)

{
 if (n % i == 0)

{
C++;

if (c == 2)

cout« "n is a Prime number" « endl;

else

cout « "n is not a Prime number" « endl;

return 0;

Palindrome program

#include <iostream>

using namespace std;

int main()

int n,r,sum=O,temp;

cout«"Enterthe Number-';
cin»n;

temp=n;

while(n>0)

r=n%10;

sum=(sum*10)+r;

n=n/10;

}
if(temp==sum)

cout«"Number is Palindrome."; else

cout«"Number is not Palindrome.";

return 0;

Factorial program

#include <iostream>

using namespace std;

int main()

int i,fact=1,number;

cout«"Enter any Number:

cin»number;

for(i=1;i<=number;i++){

fact=fact*i;

cout«"Factorial of" «number«" is: "«fact«endl;

return 0;

Armstrong Number
Armstrong number is a number that is equal to the sum of cubes of its
digits. For example 0,1,153, 370, 371 and 407 are the Armstrong
numbers.
#include <iostream>

using namespace std;

int main()

int n,r,sum=0,temp;

cout«"Enter the Number=

cin»n;

temp=n;

while(n>0)

r=n%10;

sum=sum+(r*r*r);

n=n/10;

if(temp==sum)

cout«"Armstrong Number. "«endl;

else

cout«"Not Armstrong Number."«endl;

return 0;
}

Sum of digits program

#include <iostream>

using namespace std;

int main()
{
int n,sum=0,m;
cout«"Enter a number:
cin»n;
while(n>0)
{
m=n%10;
sum=sum+m;
n=n/10;
}
cout«"Sum is= "«sum«endl;
return 0;
}
Program to reverse number
#include <iostream>

using namespace std;

int main()

int n, reverse=0, rem;

cout«"Enter a number:

cin»n;

while(n!=0)

rem=n%10;

reverse=reverse*10+rem;

n/=10;

cout«"Reversed Number: "«reverse«endl; return

0;
swap two numbers without third variable
#include <iostream>
using namespace std;
int main()
{
int a=5, b=10;
cout«"Before swap a= "«a«" b= "«b«endl;
a=a+b; //a=15 (5+10)
b=a-b; //b=5 (15-10)
a=a-b;//a=10 (15-5)
cout«"After swap a= "«a«" b= "«b«endl; return 0;
}

count the number of vowels in a string

#include <iostream>

#include <string.h>

using namespace std;

int main()

//Initializing variable.

char str[100];

int i,vowels=0;

//Accepting input.

cout«"Enter the string :

gets(str);

//Initializing for loop.

for(i=0;str[i];i++)

//Counting the vowels.

if(str[i]=-a’||
str[i]=='e'||str[i]=='i'||str[i]=='o'||str[i]=='u'||str[i]=='A'||str[i]=='E'||str[i]=
=T||str[i]=='O' ||str[i]=='U')

{
 vowels++;

//Printing the count of vowels.

cout«"Total number of vowels in the string = "«vowels; return 0;