C | Coding Fun

Fibnaaci series Implementation by recussion

Manoj November 10, 2017 0

#include <iostream>
using namespace std;
//print the Fibnacci Nubmer for a given number
int  fibrecur(int n)
{
    if(n<3)
        return 1;
    else
    return fibrecur(n-1)+fibrecur(n-2);
}
int main(){
    int num;
    cout<<"Enter the Number"<<endl;
    cin>>num;
    int n=fibrecur(num);
    cout<<"Finaaci Number is " << n <<endl;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

#include <iostream>

using namespace std;

//print the Fibnacci Nubmer for a given number

int fibrecur(int n)

{

if(n<3)

return 1;

else

return fibrecur(n-1)+fibrecur(n-2);

}

int main(){

int num;

cout<<"Enter the Number"<<endl;

cin>>num;

int n=fibrecur(num);

cout<<"Finaaci Number is " << n <<endl;

}

1,816 total views, 5 views today

Factorial by Recursion method

Manoj November 10, 2017 0

//factorial By Recuresion
#include <iostream>

using namespace std;
int fact(int num){
    
if(num==0 || num ==1){
    return 1;
}
    int ans=num*fact(num-1);
return ans;
}
int main(int argc, char const *argv[])
{
    int num;
    cout<<"Enter The NUmber Whose Factorial is to be find out"<<endl;
    cin>>num;
    int ans=fact(num);
    cout<<"Factorial of given Number is ::"<< ans <<endl;
    
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

//factorial By Recuresion

#include <iostream>

using namespace std;

int fact(int num){

if(num==0 || num ==1){

return 1;

}

int ans=num*fact(num-1);

return ans;

}

int main(int argc, char const *argv[])

{

int num;

cout<<"Enter The NUmber Whose Factorial is to be find out"<<endl;

cin>>num;

int ans=fact(num);

cout<<"Factorial of given Number is ::"<< ans <<endl;

return 0;

}

2,456 total views, 5 views today

Convert lower case string to uper case

Manoj November 10, 2017 0

//Convert lowerCase String to Upper Case, 
//compiler used is g++
#include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main(){
    char str[100]="manoj";
    int len=strlen(str);
for(int i=0;i<len;i++)
{
    str[i]=str[i]-32;
}
cout<<"String is "<<endl;
for(int i=0;i<len;i++)
{
    cout<<str[i];
}
cout<<endl;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

//Convert lowerCase String to Upper Case,

//compiler used is g++

#include <iostream>

#include <string>

#include <string.h>

using namespace std;

int main(){

char str[100]="manoj";

int len=strlen(str);

for(int i=0;i<len;i++)

{

str[i]=str[i]-32;

}

cout<<"String is "<<endl;

for(int i=0;i<len;i++)

{

cout<<str[i];

}

cout<<endl;

}

1,746 total views, 10 views today

Count the Number of words in a file.

Manoj November 7, 2017 0

#include <iostream>
#include <stdio.h>
using namespace std;
// g++ compiler is used 

int main()
{
    FILE *fp;
    char ch;
    int w=1;
    fp=fopen("manojfile.txt", "r");
    if(fp==NULL){
        cout<<"File Not Found"<<endl;
    }
    else{
        ch=fgetc(fp);
        while(ch!=EOF)
        {
            //  cout<<ch<<endl;
            if(ch==' '|| ch=='\0')
            {
                w++;
            }
            ch=fgetc(fp);
        }
        cout<<"Number of words is:: "<<w<<endl;
    }
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

#include <iostream>

#include <stdio.h>

using namespace std;

// g++ compiler is used

int main()

{

FILE *fp;

char ch;

int w=1;

fp=fopen("manojfile.txt", "r");

if(fp==NULL){

cout<<"File Not Found"<<endl;

}

else{

ch=fgetc(fp);

while(ch!=EOF)

{

// cout<<ch<<endl;

if(ch==' '|| ch=='\0')

{

w++;

}

ch=fgetc(fp);

}

cout<<"Number of words is:: "<<w<<endl;

}

return 0;

}

1,701 total views, 5 views today

Prime Number program Implementation

Manoj November 7, 2017 0

#include <iostream>
#include <cmath>

using namespace std;

int prime(int number){
    for (int i = 2; i <= sqrt(number); ++i)
    {
        if(number%i!=0)
        {
            return 0;
        }
        else
        {
            return 1;
        }
    }

}
int main(int argc, char const *argv[])
{
    int num;
    cout<<"Enter A Numebr"<<endl;
    cin>>num;
    int pnumber=prime(num);
    if(pnumber==0)
    {
        cout<<"Given Number is prime"<<endl;
    }
    else
    {
        cout<<"Given Number is not Prime"<<endl;
    }
        
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

#include <iostream>

#include <cmath>

using namespace std;

int prime(int number){

for (int i = 2; i <= sqrt(number); ++i)

{

if(number%i!=0)

{

return 0;

}

else

{

return 1;

}

int main(int argc, char const *argv[])

{

int num;

cout<<"Enter A Numebr"<<endl;

cin>>num;

int pnumber=prime(num);

if(pnumber==0)

{

cout<<"Given Number is prime"<<endl;

}

else

{

cout<<"Given Number is not Prime"<<endl;

}

return 0;

}

1,981 total views, 5 views today

Write a program to find out the total number of digit in given Number

Manoj November 7, 2017 0

//find the  numbber of digit from a given Number 
// g++ compiler used
#include <iostream>
using namespace std;

int countNumberOfDigit(int num){
	int count=0;
	while(num){
		num=num/10;
		count++;
	}
	return count;
}
int main(int argc, char const *argv[])
{
	int num;
	cout<<"Enter any Numer"<<endl;
	cin>>num;
	int totalDigit=countNumberOfDigit(num);
	cout<<"Total Number of Digit in Number :" << num << " is " << totalDigit <<endl;
	return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

//find the numbber of digit from a given Number

// g++ compiler used

#include <iostream>

using namespace std;

int countNumberOfDigit(int num){

int count=0;

while(num){

num=num/10;

count++;

}

return count;

}

int main(int argc, char const *argv[])

{

int num;

cout<<"Enter any Numer"<<endl;

cin>>num;

int totalDigit=countNumberOfDigit(num);

cout<<"Total Number of Digit in Number :" << num << " is " << totalDigit <<endl;

return 0;

}

1,761 total views, 5 views today

Find the given year is leap or not !!

Manoj November 7, 2017 0

#include <iostream>

using namespace std;

void leapyear(int year){
    if((year%4==0)||(year%400==0) && (year%100!=0))
        cout<<"Enter year is leap year"<<endl;
    else
        cout<<"Enter year is not leap year"<<endl;
}
int main(int argc, char const *argv[])
{
    int year;
    cout<<"Enter The Year"<<endl;
    cin>>year;
    leapyear(year);
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

#include <iostream>

using namespace std;

void leapyear(int year){

if((year%4==0)||(year%400==0) && (year%100!=0))

cout<<"Enter year is leap year"<<endl;

else

cout<<"Enter year is not leap year"<<endl;

}

int main(int argc, char const *argv[])

{

int year;

cout<<"Enter The Year"<<endl;

cin>>year;

leapyear(year);

return 0;

}

1,991 total views, no views today

Convert the given Integer in to Octal Number

Manoj November 7, 2017 0

#include <iostream>
using namespace std;
//Compiler Used: gcc 

void tooctal(int deciNum){
	int arr[100];
	int i=0;
	int r;
	while(deciNum>0){
		
		r=deciNum%8;
		deciNum=deciNum/8;
		
		arr[i++]=r;
		
	}
	
	
	cout<<"Decimal Number in to Octal is "<<endl;
	for(int j=i-1; j>=0;--j){
		cout<<arr[j];
	}

}

int main(){

	int num;
	cout<<"Enter the Number to Convert"<<endl;
	cin>>num;
	tooctal(num);
	cout<<"\n";
	return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

#include <iostream>

using namespace std;

//Compiler Used: gcc

void tooctal(int deciNum){

int arr[100];

int i=0;

int r;

while(deciNum>0){

r=deciNum%8;

deciNum=deciNum/8;

arr[i++]=r;

}

cout<<"Decimal Number in to Octal is "<<endl;

for(int j=i-1; j>=0;--j){

cout<<arr[j];

}

int main(){

int num;

cout<<"Enter the Number to Convert"<<endl;

cin>>num;

tooctal(num);

cout<<"\n";

return 0;

}

1,530 total views, 10 views today

Convert the given integer in to Hexadecimal

Manoj November 7, 2017 0

//Convert the given integer in to hexaDecimal

#include <iostream>
using namespace std;

void convertToHexa(int num){
	char hexaDecimal[100];
	int j=0;
	while(num){
		int remainder=num%16;
		if(remainder<10){
			hexaDecimal[j++]=remainder+48;
		}
		else{
			hexaDecimal[j++]=remainder+55;
		}

		
		num=num/16;
		}
		for (int i = j; i >=0 ; i--)
		{
			cout<< "HexaDecimal Numbers are :" << hexaDecimal[i];
		}
		cout<<"endl;"
	
}

int main()
{
	long int num;
	cout<<"Enter The Number To Be Conerted"<<endl;
	cin>>num;
	convertToHexa(num);

	return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

//Convert the given integer in to hexaDecimal

#include <iostream>

using namespace std;

void convertToHexa(int num){

char hexaDecimal[100];

int j=0;

while(num){

int remainder=num%16;

if(remainder<10){

hexaDecimal[j++]=remainder+48;

}

else{

hexaDecimal[j++]=remainder+55;

}

num=num/16;

}

for (int i = j; i >=0 ; i--)

{

cout<< "HexaDecimal Numbers are :" << hexaDecimal[i];

}

cout<<"endl;"

}

int main()

{

long int num;

cout<<"Enter The Number To Be Conerted"<<endl;

cin>>num;

convertToHexa(num);

return 0;

}

1,706 total views, 5 views today

C programs to implement the toupper() and the isupper() functions!

Manoj November 6, 2017 0

Its important to know that the upper and lower case alphabets have corresponding integer values. A-Z – 65-90 a-z – 97-122

#include <stdio.h>
//To Upper
int toUpper(int ch)
{
if(ch>='a' && ch<='z')
return('A' + ch - 'a');
else
return(ch);
}

// isUpper

int isUpper(int ch)
{
if(ch>='A' && ch <='Z')
return(1); //Yes, its upper!
else
return(0); // No, its lower!
}

int main(){

	int ch='a';
	int upper;
	int t=isUpper(ch);
	if(t==0){
	int upper;
	upper=toUpper(ch);
	printf("%c\n", upper);
	}
	else{
		//do nothing
	}
	
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

#include <stdio.h>

//To Upper

int toUpper(int ch)

{

if(ch>='a' && ch<='z')

return('A' + ch - 'a');

else

return(ch);

}

// isUpper

int isUpper(int ch)

{

if(ch>='A' && ch <='Z')

return(1); //Yes, its upper!

else

return(0); // No, its lower!

}

int main(){

int ch='a';

int upper;

int t=isUpper(ch);

if(t==0){

int upper;

upper=toUpper(ch);

printf("%c\n", upper);

}

else{

//do nothing

}

2,346 total views, 15 views today